S. Ben-David
O. Goldreich
ABSTRACT
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A. Levin. Previous works [Levin 84, Gurevich 87, Venkatesan and Levin 88] have focused on the existence of complete problems. We widen the scope to other basic questions in computational complexity. Our results include:
the equivalence of search and decision problems in the context of average case complexity;
an initial analysis of the structure of distributional-NP under reductions which preserve average polynomial-time;
a proof that if all distributional-NP is in average polynomial-time then non-deterministic exponential-time equals deterministic exponential time (i.e., a collapse in the worst case hierarchy);
definitions and basic theorems regarding other complexity classes such as average log-space.
- 1.Carter, J., and M. Wegman, "Universal Classes of Hash Functions", JC$$, 1979, Vol. 18, pp. 143-154.Google Scholar
Cross Ref
- 2.Cook, S.A., "The Complexity of Theorem Proving Procedures", Proc. 3rd A CM $ymp. on Theory of Computing, pp. 151-158, 1971. Google ScholarDigital Library
- 3.Garey, M.R., ~nd D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979. Google ScholarDigital Library
- 4.Goldreich, O., "Towards a Theory of Average Case Complexity (a survey)~', TR-531, Computer Science Department, Technion, Haifa, Israel, March 1988.Google Scholar
- 5.Gurevich, Y. "Complete and Incomplete Randomized NP Problems", Proc. of the 28th IEEE $ym?. on Foundation of Computer Science, 1987, pp. 111-117.Google Scholar
- 6.Gurevich, Y., and D. McC~uley, "Average Case Complete Problems", preprint, 1987.Google Scholar
- 7.Impagliazzo, R., L.A. Levin and M. Luby, "Pseudorandom Number Generation from any One-Way Function", these proceedings, 1989. Google ScholarDigital Library
- 8.Johnson, D.S., "The NP-Complete Cohmn--an ongoing guide", Jour. of Algorithms, 1984, Vol. 4, pp. 284-299.Google ScholarCross Ref
- 9.Karp, R.M., "Reducibility among Combinatorial Problems", Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (eds.), Plenum Press, pp. 85-103, 1972.Google Scholar
- 10.Karp, R.M., "Probabilistic Analysis of Algorithms" manuscript 1986Google Scholar
- 11.Kaxp, R.M., E. Upfal, and A. Wigderson, "Are Search and Decision Problems Computationally Equivalent?", Proc. 17th A CM Syrup. on Theory of Computing, 1985, pp. 464-475. Google ScholarDigital Library
- 12.Ladner, R.E., "On the Structure of Polynomial Time Reducibility", Jour. of the A CM, 22, 1975, pp. 155-171. Google ScholarDigital Library
- 13.Levin, L.A., "Universal Search Problems'', Problemy Peredaci Informacii 9, pp. 115-116, 1973. Translated in problems of Information Transmission 9, pp. 265-266.Google Scholar
- 14.Levin, L.A., "Average Case Complete Problems", SIAM Jour. of Computing, 1986, Vol. 15, pp. 285-286. Extended abstract appeared in Proc. 16th A CM Syrup. on Theory of Computing, 1984, p. 465. Google ScholarDigital Library
- 15.Levin, L.A., "One-Way Function and Pseudorandom Generators", Proc. 17th A CM Syrup. on Theory of Computing, 1985~ pp. 363-365. Google ScholarDigital Library
- 16.Levin, L.A., "Homogenous Measures ~ad Polynomial Time Iavaxiaz~ts", Proc. 29th IEEE Syrup. on Foundations of Computer Science, 1988, pp. 36-41.Google Scholar
- 17.Ruzzo, W.L., "Oa Uniform Circuit Complexity", JCS$, 22, 1981, pp. 365- 385.Google ScholarCross Ref
- 18.Sipser, M., "A Complexity Theoretic Approach to Randomness", Proc. 15th A CM $ymp. on Theory of Computing, 1983, pp. 330-335. Google ScholarDigital Library
- 19.Stockmeyer, L.J., "The Complexity of Approximate Counting", Proc. 15th A CM Syrup. on Theory of Computing, 1983, pp. 118-126. Google ScholarDigital Library
- 20.Valiant, L.G., and V.V. Vazirani, "NP is as Easy as Dei;ecting Unique Solutions", Proc. 17th A CM Syrup. on Theory of Computing, 1985, pp. 458-463. Google ScholarDigital Library
- 21.Venkatesan, R., and L.A. Levin, "Random Instances of a Graph Coloring Problem are Hard", Proc. 20th A CM Syrup. on Theory of Computing, 1988, pp. 217-222. Google ScholarDigital Library
Index Terms
- On the theory of average case complexity
Recommendations
Relations between Average-Case and Worst-Case Complexity
The consequences of the worst-case assumption NP=P are very well understood. On the other hand, we only know a few consequences of the analogous average-case assumption “NP is easy on average.” In this paper we establish several new results on the worst-...
Comments