Probabilistic martingales and BPTIME classes

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 186-200

  Regan, K W ^a   Sivakumar, D ^b  

^a UNIVERSITY AT BUFFALO   (United States)

^b UNIVERSITY OF HOUSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED ERRORS; COMPLEXITY CLASS; NATURAL PROOFS; PROBABILISTIC MEASURES; RANDOMIZED APPROXIMATION SCHEMES; ROBUSTNESS PROPERTIES; TIME HIERARCHY;

COMPUTATIONAL COMPLEXITY;

EID: 0342604167     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694604     Document Type: Conference Paper

References (26)

1. [Amb86] K. Ambos-Spies. Relativizations, randomness, and polynomial reducibilities. In Proceedings, First Annual Conference on Structure in Complexity Theory, volume 223 of Lect. Notes in Comp. Sci., pages 23-34. Springer Verlag, 1986.
2. [AS94] E. Allender and M. Strauss. Measure on small complexity classes, with applications for BPP. In Proc. 35thAnnual IEEE Symposiumon Foundations of Computer Science, pages 807-818, 1994.
3. [AS95] E. Allender and M. Strauss. Measure on P: Robustness of the notion. In Proc. 20th International SymposiumonMathematical Foundations of Computer Science, volume 969 of Lect. Notes in Comp. Sci., pages 129-138. Springer Verlag, 1995.
4. [BFT95] H. Buhrman, L. Fortnow, and L. Torenvliet. Using autoreducibility to separate complexity classes. In 36th Annual Symposium on Foundations of Computer Science, pages 520-527, Milwaukee, Wisconsin, 23-25 October 1995. IEEE.
5. [BG81a] C. Bennett and J. Gill. Relative to a random oracle A, PA 6= NPA 6= coNPA with probability 1. SIAM J. Comput., 10:96-113, 1981.
6. [BG81b] C. Bennett and J. Gill. Relative to a random oracle A, PA 6= NPA 6= coNPA with probability 1. SIAM J. Comput., 10:96-113, 1981.
7. [BL96] H. Buhrman and L. Longpré. Compressibility and resource boundedmeasure. In 13th Annual Symposium on Theoretical Aspects of Computer Science, volume 1046 of lncs, pages 13-24, Grenoble, France, 22-24 February 1996. Springer.
8. [BMR+98] H. Buhrman, D. van Melkebeek, K. Regan, D. Sivakumar, and M. Strauss. A generalization of resource-bounded measure, with an application. In Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lect. Notes in Comp. Sci., pages 161-171. Springer Verlag, 1998.
9. [CLL+95] J.-Y. Cai, R. Lipton, L. Longpré, M. Ogihara, K. Regan, and D. Sivakumar. Communication complexity of key agreement on limited ranges. In Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science, volume 900 of Lect. Notes in Comp. Sci., pages 38-49. Springer Verlag, 1995.
10. [CSS97] J.-Y. Cai, D. Sivakumar, and M. Strauss. Constant depth circuits and the Lutz hypothesis. In Proc. 38th Annual IEEE Symposium on Foundations of Computer Science, pages 595-604, 1997.
11. [FS89] L. Fortnow and M. Sipser. Probabilistic computation and linear time. In Proc. 21st Annual ACM Symposium on the Theory of Computing, pages 148-156, 1989.
12. [FS97] L. Fortnow andM. Sipser. Retraction of "Probabilistic computation and linear time". In Proc. 29th Annual ACM Symposium on the Theory of Computing, page 750, 1997.
13. [GZ97] O. Goldreich and D. Zuckerman. Another proof that BPP - PH (and more). Technical Report TR97-045, Electronic Colloquium on Computational Complexity (ECCC), September 1997.
14. [HILL91] J. Hastad, R. Impagliazzo, L. Levin, andM. Luby. Construction of a pseudo-random generator from any one-way function. Technical Report 91-68, International Computer Science Institute, Berkeley, 1991.
15. [JS89] M. Jerrum and A. Sinclair. Approximating the permanent. SIAM J. Comput., 18:1149-1178, 1989.
16. [JVV86] M. Jerrum, L.Valiant, andV. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theor. Comp. Sci., 43:169-188, 1986.
17. [KL83] R. Karp andM. Luby. Monte-Carlo algorithms for enumeration and reliability problems. In Proc. 24th Annual IEEE Symposium on Foundations of Computer Science, pages 56-64, 1983.
18. [Ko83] K. Ko. On the definitions of some complexity classes of real numbers. Math. Sys. Thy., 16:95-109, 1983.
19. [KV87] M. Karpinski and R. Verbeek. Randomness, provability, and the separation of Monte Carlo time and space. In Computation Theory and Logic, volume 270 of Lect. Notes in Comp. Sci., pages 189-207. Springer Verlag, 1987.
20. [Lut92] J. Lutz. Almost everywhere high nonuniform complexity. J. Comp. Sys. Sci., 44:220-258, 1992.
21. [May94] E. Mayordomo. Contributions to the Study of Resource-Bounded Measure. PhD thesis, Universidad Polytécnica de Catalunya, Barcelona, April 1994.
22. [NW88] N. Nisan and A. Wigderson. Hardness vs. randomness. In Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, pages 2-11, 1988.
23. [RR97] A. Razborov and S. Rudich. Natural proofs. J. Comp. Sys. Sci., 55:24-35, 1997.
24. [RSC95] K. Regan, D. Sivakumar, and J.-Y. Cai. Pseudorandom generators, measure theory, and natural proofs. In Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, pages 26-35, 1995.
25. [RV97] R. Rettinger and R. Verbeek. BPP equals BPLINTIME under an oracle (extended abstract), November 1997.
26. [Str97] M. Strauss. Measure on P - strength of the notion. Inform. and Comp., 136:1-23, 1997.