How hard is it to marry at random? (On the approximation of the permanent)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Combinatorica
SIAM Journal on 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
Computational Complexity
Journal of Computer and System Sciences
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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 polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomized squaring of graphs
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
| Hi-index | 0.00 |
Warmest thanks to guest columnist Oded Goldreich for this issue's article. Also, I'd like to commend to all readers the web directory, www.wisdom.weizmann.ac.il/~oded/cc-texts.html, that appears as reference [15] of Oded's column. This directory is a real treasure trove.