Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Dinur, Irit - Department of Computer Science and Applied Mathematics, Weizmann Institute of Science
Composition of low-error 2-query PCPs using decodable PCPs Prahladh Harsha
Decodability of Group Homomorphisms beyond the Johnson Bound
Robust local testability of tensor products of LDPC Irit Dinur1
ApproximatingCVP to within AlmostPolynomial Factors is NPHard TelAviv University
Annals of Mathematics, 162 (2005), 439485 On the hardness of approximating
The PCP Theorem by Gap Amplification February 13, 2007
On the Fourier tails of bounded functions over the discrete cube
SIGACT Complexity Column: PCPs with Small Soundness Error The soundness error of a PCP verifier is the probability (usually denoted ) that the verifier
The Structure of Winning Strategies in Parallel Repetition Games
Probabilistically Checkable Proofs The Weizmann Institute of Science
Independent Sets in Graph Powers are Almost Contained in Irit Dinur
Conditional Hardness for Approximate Coloring Elchanan Mossel
Proof of an intersection theorem via graph homomorphisms.
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
Locally Testing Direct Products in the Low Error Range Weizmann Institute
Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010
Intersecting families are essentially contained in juntas Irit Dinur
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs Weizmann Institute
Dense locally testable codes cannot have constant rate and distance
