The Power and Weakness of Randomness in Computation

DOI10.1007/11682462_7MaRDI QIDQ3525743zbMATH OpenOpenAlexFDO

Authors A. Wigderson

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_7

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Randomized algorithms (68W20) Cryptography (94A60)

Recommendations

• Randomness, computation and mathematics
• Randomness and computation
• Randomness -- a computational complexity perspective
• scientific article; zbMATH DE number 7377983
• Some bridging results and challenges in classical, quantum and computational randomness

Cited in

(9)

• On randomized versus deterministic computation
• Sex: the power of randomization
• Using the renormalization group to classify Boolean functions
• Some bridging results and challenges in classical, quantum and computational randomness
• scientific article; zbMATH DE number 6019540 (Why is no real title available?)
• Randomness – A Computational Complexity Perspective
• scientific article; zbMATH DE number 5657607 (Why is no real title available?)
• Computing with Very Weak Random Sources
• scientific article; zbMATH DE number 1790493 (Why is no real title available?)

This page was built for publication: The Power and Weakness of Randomness in Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525743)