Towards average-case complexity analysis of NP optimization problems

Authors:
R. Schuler;O. Watanabe
Affiliations:
-;-
Venue:
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Year:
1995

Citing 0
Cited 4

Some Results on Derandomization

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Non-Recursive Power of Erroneous Computation

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Average-case intractability vs. worst-case intractability

Information and Computation
Average-case non-approximability of optimisation problems

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the worst-case complexity measure, if P=NP, then P=OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a similar relation holds when considering average-case complexity. We investigate the relationship between the complexity of NP decision problems and that of NP optimization problems under polynomial-time computable distributions, and study what makes them (seemingly) different. It is shown that the difference between P/sub tt//sup NP/-samplable and P/sup NP/-samplable distributions is crucial.