Monte-Carlo polynomial versus linear time - The truth-table case

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

Volumn 2138, Issue , 2001, Pages 311-322

  Rettinger, Robert ^a   Verbeek, Rutger ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

LINEAR TIME; THEORETICAL LIMITS; TRUTH TABLES;

COMPUTATION THEORY;

EID: 84974735681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_30     Document Type: Conference Paper

References (12)

1. Allender, Beigel, Hertrampf, Homer, Almost-everywhere Complexity Hierarchies for Nondeterministic Time, TCS 115(1993), pp. 225-241.
2. Balcazar, Diaz, Gabarro, Structural Complexity 2, Springer 1990.
3. Berg, Håstad, On the BPP Hierarchy Problem, Technical Report TRITA-NA-9702, Royal Inst. of Technology, Stockholm 1997.
4. Freivalds, Probabilistic two-way Machines, Proc. MFCS, LNCS 118, Springer 1981, pp. 33-45.
5. Fortnow, Sipser, Probabilistic Computation and Linear Time, ACM Symposium on Theory of Computing (STOC), 1989, pp. 148-156.
6. Fortnow, Sipser, Retraction of Probabilistic Computation and Linear Time, ACM Symposium on Theory of Computing (STOC), 1997, p. 750.
7. Hemaspaandra, Complexity Theory Column 11, SIGACT News 26,4 (1995), pp. 5-15.
8. Karpinski, Verbeek, On the Monte Carlo Space Constructible Functions and Separation Results for Probabilistic Complexity Classes, Information and Computation 75 (1987), pp. 178-189.
9. Karpinski, Verbeek, Randomness, Provability and the Separation of Monte Carlo Time and Space, Computation Theory and Logic, LNCS 270 (1987), pp. 189-207.
10. Rettinger, Orakelabhängige Zeithierarchiesätze, PhD thesis, FernUniversität Hagen, 1999.
11. Rackoff, Seiferas, Limitations on Separating Nondeterministic Complexity Classes, SIAM Journal on Computing 10 (1981), pp. 742-745.
12. Seiferas, Fischer, Meyer, Separating Nondeterministic Time Complexity Classes, JACM 25, pp. 146-167.