Randomness - A computational complexity perspective

A. Wigderson*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Man has grappled with the meaning and utility of randomness for millennia. Randomness is paramount to many fields of science, and probabilistic algorithms play a key role is solving important problems in many disciplines. Computational complexity theory offers new insights about the power and limit of randomness in such settings, and a concrete computational notion of pseudo-randomness.

Original languageEnglish
Title of host publicationXVIIth International Congress on Mathematical Physics
Subtitle of host publicationAalborg, Denmark, 6-11 August 2012
PublisherWorld Scientific Publishing Co.
Pages254-266
Number of pages13
ISBN (Electronic)9789814449243
ISBN (Print)9789814449236
DOIs
StatePublished - 1 Jan 2013
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2014 by World Scientific Publishing Co. Pte. Ltd. All rights reserved.

Fingerprint

Dive into the research topics of 'Randomness - A computational complexity perspective'. Together they form a unique fingerprint.

Cite this