Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Are there interactive protocols for CO-NP languages?
Information Processing Letters
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
On the power of two-point based sampling
Journal of Complexity
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Simulating BPP using a general weak random source
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Self-testing polynomial functions efficiently and over rational domains
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
The random oracle hypothesis is false
Journal of Computer and System Sciences
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The complexity of the max word problem and the power of one-way interactive proof systems
Computational Complexity
Approximation algorithms for NP-hard problems
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
The hardness of cache conscious data placement
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
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
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Deterministic identity testing for multivariate polynomials
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Clique Is Hard to Approximate within n1-o(1)
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Inapproximability Results for Equations over Finite Groups
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the hardness of approximating N P witnesses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
Simple analysis of graph tests for linearity and PCP
Random Structures & Algorithms
Property testing in massive graphs
Handbook of massive data sets
Derandomizing polynomial identity tests means proving circuit lower bounds
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
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
On the approximability of clique and related maximization problems
Journal of Computer and System Sciences
On interactive proofs with a laconic prover
Computational Complexity
Fast approximate probabilistically checkable proofs
Information and Computation
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
Journal of Computer and System Sciences - Special issue on FOCS 2002
On the advantage over a random assignment
Random Structures & Algorithms
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Simple PCPs with poly-log rate and query complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Asymmetric k-center is log* n-hard to approximate
Journal of the ACM (JACM)
On Non-Approximability for Quadratic Programs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Almost Orthogonal Linear Codes are Locally Testable
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
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Sub-constant error low degree test of almost-linear size
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On maximizing welfare when utility functions are subadditive
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The PCP theorem by gap amplification
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
Robust locally testable codes and products of codes
Random Structures & Algorithms
APX-hardness of domination problems in circle graphs
Information Processing Letters
SIGACT news complexity theory column 51
ACM SIGACT News
The hardness of cache conscious data placement
Nordic Journal of Computing
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Journal of Computer and System Sciences - Special issue on FOCS 2003
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
On the complexity of approximating k-set packing
Computational Complexity
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
SIGACT news complexity theory column 52
ACM SIGACT News
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
New hardness results for congestion minimization and machine scheduling
Journal of the ACM (JACM)
The PCP theorem by gap amplification
Journal of the ACM (JACM)
A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies
INFORMS Journal on Computing
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Low-degree tests at large distances
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Extending tamper-proof hardware security to untrusted execution environments
CARDIS'02 Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5
A Generic Time Hierarchy with One Bit of Advice
Computational Complexity
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
Finding large 3-free sets I: The small n case
Journal of Computer and System Sciences
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Infeasibility of instance compression and succinct PCPs for NP
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
Combinatorial construction of locally testable codes
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
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
PCPs with small soundness error
ACM SIGACT News
Succinct NP Proofs from an Extractability Assumption
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
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
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
Random Structures & Algorithms
Hardness of Embedding Metric Spaces of Equal Size
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
ACM SIGACT News
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Cube Attacks on Tweakable Black Box Polynomials
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
New direct-product testers and 2-query PCPs
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
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
ACM Transactions on Computation Theory (TOCT)
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
APX-hardness of domination problems in circle graphs
Information Processing Letters
Guest column: from randomness extraction to rotating needles
ACM SIGACT News
Short PCPPs verifiable in polylogarithmic time with O(1) queries
Annals of Mathematics and Artificial Intelligence
Two-query PCP with subconstant error
Journal of the ACM (JACM)
On approximating minimum infrequent and maximum frequent sets
DS'07 Proceedings of the 10th international conference on Discovery science
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Information hiding in software with mixed Boolean-arithmetic transforms
WISA'07 Proceedings of the 8th international conference on Information security applications
Sub-linear zero-knowledge argument for correctness of a shuffle
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Incrementally verifiable computation or proofs of knowledge imply time/space efficiency
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Data stream algorithms for codeword testing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Other complexity classes and measures
Algorithms and theory of computation handbook
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
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
On the hardness of learning intersections of two halfspaces
Journal of Computer and System Sciences
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
SIAM Journal on Computing
Unique Games with Entangled Provers Are Easy
SIAM Journal on Computing
Guest column: testing linear properties: some general theme
ACM SIGACT News
Inapproximability of b-matching in k-uniform hypergraphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Theoretical Computer Science
Limitation on the rate of families of locally testable codes
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
Limitation on the rate of families of locally testable codes
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
High-rate codes with sublinear-time decoding
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
Properties of local quantum operations with shared entanglement
Quantum Information & Computation
A simple deterministic reduction for the gap minimum distance of code problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs
Studies in complexity and cryptography
Short locally testable codes and proofs
Studies in complexity and cryptography
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
Studies in complexity and cryptography
On obfuscating programs with tamper-proof hardware
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Characterizations of locally testable linear-and affine-invariant families
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Satisfying degree-d equations over GF[2]n
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
On sums of locally testable affine invariant properties
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Limits on the rate of locally testable affine-invariant codes
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Symmetric functions capture general functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Practical delegation of computation using multiple servers
Proceedings of the 18th ACM conference on Computer and communications security
Verifying computations with streaming interactive proofs
Proceedings of the VLDB Endowment
Cryptography in constant parallel time
Cryptography in constant parallel time
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
Characterizations of locally testable linear- and affine-invariant families
Theoretical Computer Science
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
Entangled Games Are Hard to Approximate
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
Disjoint cycles: integrality gap, hardness, and approximation
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Tolerant locally testable codes
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
The tensor product of two codes is not necessarily robustly testable
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Computing the independence number of intersection graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Gap amplification in PCPs using lazy random walks
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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
On the complexity of hilbert’s 17th problem
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Guest column: algebraic construction of projection PCPs
ACM SIGACT News
On parameterized approximability
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On pseudorandom generators with linear stretch in NC0
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Robust local testability of tensor products of LDPC codes
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Efficient zero-knowledge arguments from two-tiered homomorphic commitments
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Self-correctors for cryptographic modules
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
The Computational Complexity of Nash Equilibria in Concisely Represented Games
ACM Transactions on Computation Theory (TOCT)
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
Secure two-party computation with low communication
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On efficient zero-knowledge PCPs
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Parallel Repetition in Projection Games and a Concentration Bound
SIAM Journal on Computing
Principles of network computing
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
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
Taking proof-based verified computation a few steps closer to practicality
Security'12 Proceedings of the 21st USENIX conference on Security symposium
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Towards an optimal query efficient PCP?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the power of many one-bit provers
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Languages with efficient zero-knowledge PCPs are in SZK
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Resolving the conflict between generality and plausibility in verified computation
Proceedings of the 8th ACM European Conference on Computer Systems
QMA variants with polynomially many provers
Quantum Information & Computation
Approximation resistance on satisfiable instances for predicates with few accepting inputs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the concrete efficiency of probabilistically-checkable proofs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
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
Guest column: the quantum PCP conjecture
ACM SIGACT News
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Verifying computations with state
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Verifying the correctness of remote executions: from wild implausibility to near practicality
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems
Locally testable codes and cayley graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
Column Subset Selection Problem is UG-hard
Journal of Computer and System Sciences
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.03 |
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilistically in polynomial time using logarithmic number of random bits and by reading sublogarithmic number of bits from the proof.We discuss implications of this characterization; specifically, we show that approximating Clique and Independent Set, even in a very weak sense, is NP-hard.