Searching for "Computational Complexity of Probabilistic Turing Machines" – sorted by Relevance.
-
Applications of Polynomial and Rational Approximation. . .
- 1984. [19] J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal
- Add To MetaCart
-
List of Publications Related to the Thesis
- of Probabilistic Turing Machines. SIAM J. Comput., 6(4):675--695, Dec. 1977. [GJ79] M.R. Garey and D.S. Johnson
- Add To MetaCart
-
Analysis and design of off-line electronic payment systems, chapter 8: Conclusions
- , "Computational complexity of probabilistic Turing machines," SIAM J. Comput., No. 6, 1977, pp. 675--695. [52] O
- Cited by 1 (0 self) – Add To MetaCart
-
Collapse of PP with a Semi-Random Source to BPP
- complexity, probabilistic Turing machines, combinatorial problems, semi-random sources. 1 Introduction Satha
- Cited by 1 (1 self) – Add To MetaCart

