On randomized versus deterministic computation
From MaRDI portal
Publication:1365675
DOI10.1016/0304-3975(95)00127-1zbMATH Open0877.68053OpenAlexW1530257172MaRDI QIDQ1365675FDOQ1365675
Authors: Marek Karpinski, Rutger Verbeek 
Publication date: 9 September 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00127-1
Recommendations
- On randomized versus deterministic computation
- Randomness -- a computational complexity perspective
- Randomness – A Computational Complexity Perspective
- On randomness, determinism and computability
- scientific article; zbMATH DE number 7377983
- Randomness and computation
- Randomness and completeness in computational complexity
- The Power and Weakness of Randomness in Computation
- scientific article; zbMATH DE number 5057386
Cites Work
- A taxonomy of problems with fast parallel algorithms
- On Approximation Algorithms for # P
- Title not available (Why is that?)
- Title not available (Why is that?)
- Circuit-size lower bounds and non-reducibility to sparse sets
- Title not available (Why is that?)
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- Title not available (Why is that?)
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Relativized Questions Involving Probabilistic Algorithms
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
Cited In (4)
This page was built for publication: On randomized versus deterministic computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365675)
