COCO 2008 - PDF Preprint Papers

COCO 2008 Annual IEEE Conference on Computational Complexity

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCO-2008 Paper

click to vote

COCO
2008
Springer

146views Algorithms» more COCO 2008»

A Direct Product Theorem for Discrepancy

13 years 6 months ago

Download www1.cs.columbia.edu

Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...

Troy Lee, Adi Shraibman, Robert Spalek

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	146	A Direct Product Theorem for Discrepancy	claim
2	129	Constraint Logic: A Uniform Framework for Modeling Computation as Games	claim
3	118	Quantum Expanders: Motivation and Constructions	claim
4	108	Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity	claim
5	100	Detecting Rational Points on Hypersurfaces over Finite Fields	claim
6	97	Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems	claim
7	95	Hardness Amplification within NP against Deterministic Algorithms	claim
8	93	Learning Complexity vs. Communication Complexity	claim
9	91	Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model	claim
10	91	Amplifying ZPP^SAT[1] and the Two Queries Problem	claim
11	90	The Power of Unentanglement	claim
12	88	Approximation of Natural W[P]-Complete Minimisation Problems Is Hard	claim
13	88	Noisy Interpolating Sets for Low Degree Polynomials	claim
14	86	The Multiplicative Quantum Adversary	claim
15	86	Using Entanglement in Quantum Multi-prover Interactive Proofs	claim
16	84	New Results on Noncommutative and Commutative Polynomial Identity Testing	claim
17	81	Amplifying Lower Bounds by Means of Self-Reducibility	claim
18	79	Randomised Individual Communication Complexity	claim
19	79	Towards Dimension Expanders over Finite Fields	claim
20	79	Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions	claim
21	74	Lower Bounds and Separations for Constant Depth Multilinear Circuits	claim
22	74	Approximation Resistant Predicates from Pairwise Independence	claim
23	72	The Sum of d Small-Bias Generators Fools Polynomials of Degree d	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers