COCO 2009 - PDF Preprint Papers

COCO 2009 Annual IEEE Conference on Computational Complexity

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCO-2009 Paper

click to vote

COCO
2009
Springer

155views Algorithms» more COCO 2009»

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

13 years 11 months ago

Download www.cs.haifa.ac.il

—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...

Ronen Shaltiel

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	155	Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma	claim
2	131	A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences	claim
3	128	An Almost Optimal Rank Bound for Depth-3 Identities	claim
4	128	Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs	claim
5	126	New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques	claim
6	124	The Complexity of the Annihilating Polynomial	claim
7	124	The Maximum Communication Complexity of Multi-Party Pointer Jumping	claim
8	121	Lower Bounds on Quantum Multiparty Communication Complexity	claim
9	119	An Approximation Algorithm for Approximation Rank	claim
10	117	The Proof Complexity of Polynomial Identities	claim
11	115	Locally Testable Codes Require Redundant Testers	claim
12	115	On the Communication Complexity of Read-Once AC^0 Formulae	claim
13	113	Are PCPs Inherent in Efficient Arguments?	claim
14	113	Extractors for Low-Weight Affine Sources	claim
15	106	Increasing the Gap between Descriptional Complexity and Algorithmic Probability	claim
16	106	Every Permutation CSP of arity 3 is Approximation Resistant	claim
17	106	Improved Approximation of Linear Threshold Functions	claim
18	105	Planar Graph Isomorphism is in Log-Space	claim
19	99	Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution	claim
20	98	Extractors for Varieties	claim
21	98	Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete	claim
22	96	Parallel Approximation of Non-interactive Zero-sum Quantum Games	claim
23	96	Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in	claim
24	96	Poly-logarithmic Independence Fools AC0 Circuits	claim
25	96	One-Way Functions and the Berman-Hartmanis Conjecture	claim
26	96	On the Complexity of Boolean Functions in Different Characteristics	claim
27	93	Quantum Copy-Protection and Quantum Money	claim
28	78	Fixed-Polynomial Size Circuit Bounds	claim
29	75	Worst-Case Running Times for Average-Case Algorithms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers