By Topic

A personal view of average-case complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Impagliazzo, R. ; Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA

The structural theory of average-case complexity, introduced by Levin (1986), gives a formal setting for discussing the types of inputs for which a problem is difficult. This is vital to understanding both when a seemingly difficult (e.g. NP-complete) problem is actually easy on almost all instances, and to determining which problems might be suitable for applications requiring hard problems, such as cryptography. The paper attempts to summarize the state of knowledge in this area, including some “folklore” results that have not explicitly appeared in print. We also try to standardize and unify definitions. Finally, we indicate what we feel are interesting research directions. We hope that the paper motivates more research in this area and provide an introduction to the area for people new to it

Published in:

Structure in Complexity Theory Conference, 1995., Proceedings of Tenth Annual IEEE

Date of Conference:

19-22 Jun 1995