On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes

Information and Computation

Volumn 75, Issue 2, 1987, Pages 178-189

  Karpinski, Marek ^a   Verbeek, Rutger ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY; MATHEMATICAL STATISTICS - MONTE CARLO METHODS;

MONTE CARLO SPACE CONSTRUCTIBLE FUNCTIONS; PROBABILISTIC COMPLEXITY CLASSES; SMALL MC-CONSTRUCTIBLE FUNCTIONS; TURING MACHINES;

AUTOMATA THEORY;

EID: 0023453210     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(87)90057-5     Document Type: Article

References (27)

1. Random walks, traversal sequences and the complexity of maze problems
2. Lower bounds on space complexity for context-free recognition
3. Reducibility, randomness and intractability
4. Lower bounds for the space complexity of context-free recognition
5. On one class of Turing machines (Minsky machines)
6. Parallel computation for well-endowed rings and space-bounded probabilistic machines
7. A with Probability 1
8. Isomorphism of graphs with bounded eigenvalue multiplicity
9. Lower bounds on graph threading by probabilistic machines
10. The classification of problems which have fast parallel algorithms
11. Probabilistic two-way machines
12. Projections of languages recognizable by probabilistic and alternating finite multitape automata
13. Space and reversal complexity of probabilistic one-way Turing machines
14. Computational complexity of probabilistic turing machines
15. An approach to a unified theory of automata
16. On probabilistic tape complexity and fast circuits for matrix inversion problems
17. Alternation and the power of non-determinism
18. Memory bounds for recognition of context-free and context-sensitive languages
19. Recursive unsolvability of Post's problem of “Tag” and other topics in the theory of Turing machines
20. On eliminating non-determinism from Turing machines which use less than logarithmic work tape space
21. Space-bounded probabilistic Turing machine complexity classes are closed under complement
22. Halting Space-bounded computations
23. A fast Monte Carlo test for Primality
24. Randomised algorithms