Equivalence of measures of complexity classes

SIAM Journal on Computing

Volumn 29, Issue 1, 1999, Pages 302-326

  Breutzmann, Josef M ^a   Lutz, Jack H ^b  

^a WARTBURG COLLEGE   (United States)

^b Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

COMPLEXITY CLASSES; MARTINGALES; RESOURCE-BOUNDED MEASURES;

EQUIVALENCE CLASSES;

EID: 0342733652     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796302269     Document Type: Article

References (29)

1. K. AMBOS-SPIES, E. MAYORDOMO, AND X. ZHENG, A comparison of weak completeness notions, in Proceedings of the Eleventh IEEE Conference on Computational Complexity, IEEE Computer Society Press, 1996, pp. 171-178.
2. K. AMBOS-SPIES, S. A. TERWIJN, AND X. ZHENG, Resource bounded randomness and weakly complete problems, Theoret. Comput. Sci., 172 (1977), pp. 195-207.
3. J. CAI AND A. L. SELMAN, Fine separation of average time complexity classes, in Proceedings of the Thirteenth Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, 1996, pp. 331-343.
4. R. I. FREIDZON, Families of recursive predicates of measure zero. J. Soviet Math., 6 (1976), pp. 449-455, 1972.
5. P. R. HALMOS, Measure Theory, Springer-Verlag, Berlin, New York, 1950.
6. D. W. JUEDES, Weakly complete problems are not rare, Computational Complexity, 5 (1995), pp. 267-283.
7. D. W. JUEDES AND J. H. LUTZ, The complexity and distribution of hard problems, SIAM J. Comput., 24 (1995), pp. 279-295.
8. 2, Theoret. Comput. Sci., 143 (1995), pp. 149-158.
9. S. KAKUTANI, On the equivalence of infinite product measures, Annals of Mathematics, 49 (1948), pp. 214-224.
10. S. M. KAUTZ, Resource-bounded randomness and compressibility with respect to nonuniform measures, in Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science, Springer-Verlag, Berlin, New York, 1997. pp. 197-211.
11. J. H. LUTZ, Almost everywhere high nonuniform complexity, J. Comput. System Sci., 44 (1992), pp. 220-258.
12. J. H. LUTZ, The quantitative structure of exponential time, in Complexity Theory Retrospective II, L. A. Hemaspaandra and A. L. Selman, eds., Springer-Verlag, Berlin, New York, 1997, pp. 225-254.
13. J. H. LUTZ, Weakly hard problems, SIAM J. Comput., 24 (1995), pp. 1170-1189.
14. 2, Theory Comput. Syst., 30 (1997), pp. 429-442.
15. J. H. LUTZ AND E. MAYORDOMO, Measure, stochasticity, and the density of hard languages, SIAM J. Comput., 23 (1994), pp. 762-779.
16. J. H. LUTZ AND E. MAYORDOMO, Genericity, measure, and inseparable pairs, in preparation.
17. J. H. LUTZ AND E. MAYORDOMO, Cook versus Karp-Levin: Separating completeness notions if NP is not small, Theoret. Comput. Sci., 164 (1996), pp. 141-163.
18. E. MAYORDOMO, Almost every set in exponential time is P-bi-immune, Theoret. Comput. Sci., 136 (1994), pp. 487-506.
19. K. MEHLHORN, The "almost all" theory of subrecursive degrees is decidable, in Proceedings of the Second Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci., 14, Springer-Verlag, New York, 1974, pp. 317-325.
20. J. C. OXTOBY, Measure and Category, 2nd ed., Springer-Verlag, Berlin, New York, 1980.
21. K. W. REGAN, D. SIVAKUMAR, AND J. CAI, Pseudorandom generators, measure theory, and natural proofs, in 36th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1995, pp. 26-35.
22. H. ROGERS, JR., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
23. C. P. SCHNORR, Klassifikation der Zufallsgesetze nach Komplexität und Ordnung, Z. Wahrscheinlichkeitstheorie verw. Geb., 16 (1970), pp. 1-21.
24. C. P. SCHNORR, A unified approach to the definition of random sequences, Math. Systems Theory, 5 (1971), pp. 246-258.
25. C. P. SCHNORR, Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, 218 (1971).
26. C. P. SCHNORR, Process complexity and effective random tests, J. Comput. System Sci., 7 (1973), pp. 376-388.
27. M. VAN LAMBALGEN, Random Sequences, Ph.D. thesis, Department of Mathematics, University of Amsterdam, Amsterdam, the Netherlands, 1987.
28. V. G. VOVK, On a randomness criterion, Soviet Mathematics Doklady, 35 (1987), pp. 656-660.
29. A. K. ZVONKIN AND L. A. LEVIN, The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms, Russian Math. Surveys, 25 (1970), pp. 83-124.