A well-characterized approximation problem
Information Processing Letters
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
SIAM Journal on Computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
On the hardness of approximating label-cover
Information Processing Letters
Journal of Computer and System Sciences - Special issue on FOCS 2002
Simple PCPs with poly-log rate and query complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Sub-constant error low degree test of almost-linear size
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
PCPs with small soundness error
ACM SIGACT News
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
Polynomial flow-cut gaps and hardness of directed cut problems
Journal of the ACM (JACM)
Approximation and Hardness Results for Label Cut and Related Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Two-query PCP with subconstant error
Journal of the ACM (JACM)
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Bounds on locally testable codes with unique tests
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |