Measure on P: Strength of the Notion

Information and Computation

Volumn 136, Issue 1, 1997, Pages 1-23

  Strauss, Martin ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009747203     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2639     Document Type: Article

References (14)

1. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), Proof verification and hardness of approximation problems, in "Proc. 33rd FOCS Conference," pp. 14-23.
2. Allender, E., and Rubinstein, R. (1988), P-printable sets, SIAM J. Comput. 17, 1193-1202.
3. Allender, E., and Strauss, M., Measure on small complexity classes, with applications for BPP, in preparation.
4. Allender, E., and Strauss, M. (1995), Measure in P: Robustness of the notion, in "Proc. 20th Mathematical Foundations of Computer Science Conference," Lecture Notes in Computer Science, Vol. 969, pp. 129-138, Springer, Berlin.
5. Babai, L., Fortnow, L., Levin, L., and Szegedy, M. (1991), Checking computations in polylogarithmic time, in "Proc, 23rd STOC Conference," pp. 21-31.
6. Cai, J.-Y., Sivakumar, D., and Strauss, M. (1995), Constant-depth circuits and the Lutz hypothesis, submitted for publication.
7. Hartmanis, J., and Yesha, Y. (1984), Computation times of NP sets of different densities, Theoret. Comput. Sci. 34, 17-32.
8. Lutz, J. (1990), Category and measure in complexity classes, SIAM J. Comput. 19, 1100-1131.
9. Lutz, J. (1992), Almost everywhere high nonuniform complexity, J. Comput. System Sci. 44, 220-258.
10. Lutz, J. (1996), The quantitative structure of exponential time, in "Complexity Theory Retrospective II" (L. Hemaspaandra and A. Selman, Eds.), Springer-Verlag, Berlin, to appear.
11. Mayordomo, E. (1994), "Contributions to the Study of Resource-Bounded Measure," Ph.D. thesis, Universitat Politècnica de Catalunya, Barcelona.
12. Merkle, W. (1995), Personal communication.
13. Regan, K., Sivakumar, D., and Cai, J.-Y. (1995), "Pseudorandom Generators, Measure Theory, and Natural Proofs," Technical Report UB-CS-TR 95-02, Computer Science Dept., University at Buffalo.
14. Regan, K., Sivakumar, D., and Cai, J.-Y. (1995), Pseudorandom generators, measure theory, and natural proofs, in "Proc. of the 36th FOCS Conference," pp. 26-35, IEEE Computer Society, Los Alamitos, CA.