On randomized versus deterministic computation
From MaRDI portal
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
- scientific article; zbMATH DE number 4091486 (Why is no real title available?)
- scientific article; zbMATH DE number 3635490 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- A taxonomy of problems with fast parallel algorithms
- Circuit-size lower bounds and non-reducibility to sparse sets
- On Approximation Algorithms for # P
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- Relativized Questions Involving Probabilistic Algorithms
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)
