PCP characterizations of NP: towards a polynomially-small error-probability
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the advantage over a random assignment
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hardness results for approximate hypergraph coloring
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - &egr;
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Inapproximability Results for Equations over Finite Groups
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Inapproximability results for set splitting and satisfiability problems with no mixed clauses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
The Non-approximability of Non-Boolean Predicates
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Simple analysis of graph tests for linearity and PCP
Random Structures & Algorithms
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A new multilayered PCP and the hardness of hypergraph vertex cover
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
On the hardness of approximating label-cover
Information Processing Letters
Inapproximability results for equations over finite groups
Theoretical Computer Science - Special issue on automata, languages and programming
Robust pcps of proximity, shorter pcps and applications to coding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Asymmetric k-center is log* n-hard to approximate
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New hardness results for congestion minimization and machine scheduling
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Logarithmic inapproximability of the radio broadcast problem
Journal of Algorithms
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Towards proving strong direct product theorems
Computational Complexity
On the advantage over a random assignment
Random Structures & Algorithms
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
Hardness of the undirected congestion minimization problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
Asymmetric k-center is log* n-hard to approximate
Journal of the ACM (JACM)
Approximation Algorithms for Unique Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On Non-Approximability for Quadratic Programs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Hardness of Approximating the Closest Vector Problem with Pre-Processing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The PCP theorem by gap amplification
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Logarithmic hardness of the directed congestion minimization problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Hardness of cut problems in directed graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Journal of Computer and System Sciences - Special issue on FOCS 2003
On the complexity of approximating k-set packing
Computational Complexity
New hardness results for congestion minimization and machine scheduling
Journal of the ACM (JACM)
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Parallel repetition: simplifications and the no-signaling case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms (TALG)
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
On the approximability of influence in social networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unique games on expanding constraint graphs are easy: extended abstract
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Network design for vertex connectivity
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On hardness of learning intersection of two halfspaces
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
PCPs with small soundness error
ACM SIGACT News
Can quantum mechanics help distributed computing?
ACM SIGACT News
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
Almost-tight hardness of directed congestion minimization
Journal of the ACM (JACM)
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
Random Structures & Algorithms
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
Improved approximating algorithms for Directed Steiner Forest
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
New direct-product testers and 2-query PCPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Bit-probe lower bounds for succinct data structures
Proceedings of the forty-first annual ACM symposium on Theory of computing
Conditional hardness for satisfiable 3-CSPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
On Approximating an Implicit Cover Problem in Biology
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Amortized Communication Complexity of Distributions
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers
ACM Transactions on Computation Theory (TOCT)
ACM Transactions on Computation Theory (TOCT)
Strong Parallel Repetition Theorem for Free Projection Games
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A Hypergraph Dictatorship Test with Perfect Completeness
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating connectivity augmentation problems
ACM Transactions on Algorithms (TALG)
Two-query PCP with subconstant error
Journal of the ACM (JACM)
Parallel repetition of computationally sound protocols revisited
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Chernoff-type direct product theorems
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Inapproximability results for equations over infinite groups
Theoretical Computer Science
David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Parallel repetition of the odd cycle game
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing
ACM SIGACT News
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The structure of winning strategies in parallel repetition games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Constructive proofs of concentration bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Improved rounding for parallel repeated unique games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A query efficient non-adaptive long code test with perfect completeness
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A K-provers parallel repetition theorem for a version of no-signaling model
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On the hardness of learning intersections of two halfspaces
Journal of Computer and System Sciences
Distinguishing distributions using Chernoff information
ProvSec'10 Proceedings of the 4th international conference on Provable security
Improved hardness of approximation for stackelberg shortest-path pricing
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
SIAM Journal on Computing
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Unique Games with Entangled Provers Are Easy
SIAM Journal on Computing
Short locally testable codes and proofs: a survey in two parts
Property testing
Query-efficient dictatorship testing with perfect completeness
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Query-efficient dictatorship testing with perfect completeness
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
Parallel repetition of entangled games
Proceedings of the forty-third annual ACM symposium on Theory of computing
NP-hardness of approximately solving linear equations over reals
Proceedings of the forty-third annual ACM symposium on Theory of computing
Approximability of capacitated network design
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Short locally testable codes and proofs
Studies in complexity and cryptography
On unique games with negativeweights
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Nearly optimal NP-hardness of vertex cover on k-uniform k-partite hypergraphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
A Counterexample to Strong Parallel Repetition
SIAM Journal on Computing
Bounds on locally testable codes with unique tests
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Approximation algorithms and hardness of the k-route cut problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating rooted Steiner networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
Inapproximability results for combinatorial auctions with submodular utility functions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
An efficient parallel repetition theorem
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Parallel repetition theorems for interactive arguments
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Almost optimal bounds for direct product threshold theorem
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Disjoint cycles: integrality gap, hardness, and approximation
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Power optimization for connectivity problems
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Hardness results for agnostically learning low-degree polynomial threshold functions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Better inapproximability results for maxclique, chromatic number and min-3lin-deletion
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Guest column: algebraic construction of projection PCPs
ACM SIGACT News
Parallel and concurrent security of the HB and HB+ protocols
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Eliminating cycles in the discrete torus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
2log1-ε n hardness for the closest vector problem with preprocessing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms and hardness of integral concurrent flow
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
Parallel Repetition in Projection Games and a Concentration Bound
SIAM Journal on Computing
Spherical cubes: optimal foams from computational hardness amplification
Communications of the ACM
Label cover instances with large girth and the hardness of approximating basic k-spanner
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
ACM Transactions on Computation Theory (TOCT)
Product rules in semidefinite programming
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Towards an optimal query efficient PCP?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Multicast routing for energy minimization using speed scaling
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Multipartite entanglement in XOR games
Quantum Information & Computation
Classical, quantum and nonsignalling resources in bipartite games
Theoretical Computer Science
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximation resistance on satisfiable instances for predicates with few accepting inputs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Product-state approximations to quantum ground states
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Direct product via round-preserving compression
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
| Hi-index | 0.02 |
We show that a parallel repetition of any two-prover one-round proof system (MIP(2,1)) decreases the probability of error at an exponential rate. No constructive bound was previously known. The constant in the exponent (in our analysis) depends only on the original probability of error and on the total number of possible answers of the two provers. The dependency on the total number of possible answers is logarithmic, which was recently proved to be almost the best possible [U. Feige and O. Verbitsky, Proc.11th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 70--76].