Randomness – A Computational Complexity Perspective
DOI10.1007/978-3-540-79709-8_1zbMath1142.68357OpenAlexW1544577176MaRDI QIDQ3503618
Publication date: 5 June 2008
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79709-8_1
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)
Cites Work
This page was built for publication: Randomness – A Computational Complexity Perspective
