Results 1 
3 of
3
AverageCase Complexity
 in Foundations and Trends in Theoretical Computer Science Volume 2, Issue 1
, 2006
"... We survey the averagecase complexity of problems in NP. We discuss various notions of goodonaverage algorithms, and present completeness results due to Impagliazzo and Levin. Such completeness results establish the fact that if a certain specific (but somewhat artificial) NP problem is easyonav ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
We survey the averagecase complexity of problems in NP. We discuss various notions of goodonaverage algorithms, and present completeness results due to Impagliazzo and Levin. Such completeness results establish the fact that if a certain specific (but somewhat artificial) NP problem is easyonaverage with respect to the uniform distribution, then all problems in NP are easyonaverage with respect to all samplable distributions. Applying the theory to natural distributional problems remain an outstanding open question. We review some natural distributional problems whose averagecase complexity is of particular interest and that do not yet fit into this theory. A major open question is whether the existence of hardonaverage problems in NP can be based on the P ̸ = NP assumption or on related worstcase assumptions. We review negative results showing that certain proof techniques cannot prove such a result. While the relation between worstcase and averagecase complexity for general NP problems remains open, there has been progress in understanding the relation between different “degrees ” of averagecase complexity. We discuss some of these “hardness amplification ” results. 1
unknown title
"... This paper connects two fundamental ideas from theoretical computer science: hardcore set construction, a type of hardness amplification from computational complexity, andboosting, a technique from computational learning theory. ..."
Abstract
 Add to MetaCart
(Show Context)
This paper connects two fundamental ideas from theoretical computer science: hardcore set construction, a type of hardness amplification from computational complexity, andboosting, a technique from computational learning theory.
unknown title
"... This paper connects two fundamental ideas from theoretical computer science: hardcore set construction, a type of hardness amplification from computational complexity, andboosting, a technique from computational learning theory. ..."
Abstract
 Add to MetaCart
(Show Context)
This paper connects two fundamental ideas from theoretical computer science: hardcore set construction, a type of hardness amplification from computational complexity, andboosting, a technique from computational learning theory.