Results on resource-bounded measure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 189-194

  Buhrman, Harry ^a   Fenner, Stephen ^b   Fortnow, Lance ^c  

^a CWI   (Netherlands)

^b UNIVERSITY OF SOUTHERN MAINE   (United States)

^c UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

POLYNOMIAL-TIME HIERARCHY; PSEUDORANDOM GENERATORS; RESOURCE-BOUNDED MEASURE;

AUTOMATA THEORY;

EID: 84951093783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_176     Document Type: Conference Paper

References (13)

1. K. Ambos-Spies, E Mayordomo, and Xizhong Zheng. A comparison of weak completeness notions. In Proceedings of Eleventh Annual Conference on Computational Complexity, pages 171-178, 1996.
2. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponen-tial simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307-318, 1993.
3. Läszlo Babai and Shlomo Moran. Proving properties of interactive proofs by a generalized counting technique. Information and Computation, 82(2):185-197, August 1989.
4. Buhrman and Torenvliet. On the cutting edge of relativization; The resource bounded injury method. In Annual International Colloquium on Automata, Languages and Programming, pages 263-273, 1994.
5. S. Femier and L. Fortnow. Beyond PNP=NEXP, In STAGS 95, volume 900 of Lecture Notes in Computer Science, pages 619-627. Springer, 1995.
6. J. Lutz and E. Mayordomo. Cook versus Karp-Levin: Separating completeness notions if NP is not small. Theoretical Computer Science, 164(1-2):141-163, 1996.
7. J. Lutz. Resource-Bounded Category and Measure in Exponential Complexity Classes. PhD thesis, Department of Mathematics, California Institute of Technology, 1987.
8. J. Lutz. Category and measure in complexity classes. SIAM J. Comput., 19(6):1100-1131, December 1990.
9. J. Lutz. Almost everywhere high nonuniform complexity. J. Computer and System Sciences, 44:220-258, 1992.
10. J. Lutz. Observations on measure and lowness for A%. In STAGS 96, volume 1046 of Lecture Notes in Computer Science, pages 87-98. Springer, 1996.
11. E. Mayordomo. Almost every set in exponential time is p-bi-immune. Theoretical Computer Science, 136(2):487-506, 1994.
12. E. Mayordomo. Contributions to the study of resource-bounded measure. PhD thesis, Universität Politecnica de Catalunya, 1994
13. K. Regan, D. Sivakumar, and J. Cai. Pseudorandom generators, measure theory, and natural proofs. In 36th Annual Symposium on Foundations of Computer Science, pages 26-35, 1995