NDLI: Weak Derandomization of Weak Algorithms: Explicit Versions of Yao’s Lemma

Please wait, while we are loading the content...

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao’s Lemma

Content Provider	Springer Nature Link
Author	Shaltiel, Ronen
Copyright Year	2011
Abstract	A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1 − ρ (where the probability is over the coin tosses of A), there exists a non-uniform deterministic algorithm B “of roughly the same complexity” such that Pr[B(x) = f(x)] ≥ 1 − ρ (where the probability is over a uniformly chosen input x). This implication is often referred to as “the easy direction of Yao’s lemma” and can be thought of as “weak derandomization” in the sense that B is deterministic but only succeeds on most inputs. The implication follows as there exists a fixed value r′ for the random coins of A such that “hardwiring r′ into A” produces a deterministic algorithm B. However, this argument does not give a way to explicitly construct B.In this paper, we consider the task of proving uniform versions of the implication above. That is, how to explicitly construct a deterministic algorithm B when given a randomized algorithm A. We prove such derandomization results for several classes of randomized algorithms. These include randomized communication protocols, randomized decision trees (here we improve a previous result by Zimand), randomized streaming algorithms, and randomized algorithms computed by polynomial-size constant-depth circuits.Our proof uses an approach suggested by Goldreich and Wigderson and “extracts randomness from the input”. We introduce a new type of (seedless) extractors that extract randomness from distributions that are “recognizable” by the given randomized algorithm. We show that such extractors produce randomness that is in some sense not correlated with the input.
Ending Page	143
Page Count	57
Starting Page	87
File Format	PDF
ISSN	10163328
e-ISSN	14208954
Journal	Computational complexity
Issue Number	1
Volume Number	20
Language	English
Publisher	SP Birkhäuser Verlag Basel
Publisher Date	2011-04-19
Publisher Place	Basel
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	circuit complexity Complexity classes (hierarchies, relations among complexity classes, etc.) Computational Mathematics and Numerical Analysis pseudorandomness communication complexity Derandomization randomness extractors Algorithm Analysis and Problem Complexity
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Computational Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma

Weak derandomization of weak algorithms: explicit versions of yao’s lemma.

Derandomized Parallel Repetition Theorems for Free Games

Is Valiant–Vazirani’s isolation probability improvable?

Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Weak derandomization of weak algorithms: explicit versions of Yao’s lemma (2009)

Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao’s Lemma

Similar Documents

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma

Weak derandomization of weak algorithms: explicit versions of yao’s lemma.

Derandomized Parallel Repetition Theorems for Free Games

Is Valiant–Vazirani’s isolation probability improvable?

Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Weak derandomization of weak algorithms: explicit versions of Yao’s lemma (2009)

Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao’s Lemma