S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70--122, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Testing Juntas - Eldar Fischer Guy (2002) (4 citations) Self-citation (Safra) (Correct)
No context found.
Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70-122, January 1998. 34
On the Hardness of Approximating Minimum Vertex Cover - Dinur, Safra (2004) Self-citation (Safra) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. J. ACM, 45(1):70--122, 1998.
The Importance of Being Biased - Dinur, Safra (2002) (23 citations) Self-citation (Safra) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 2--13, 1992.
Graph Algorithms for Planning and Partitioning - Chawla (2005) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70--122, 1998.
Zero Knowledge and the Chromatic Number - Uriel Feige Joe (1996) (90 citations) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 2--13, 1992.
A Lower-Bound Result on the Power of a Genetic Algorithm - Park (1993) (1 citation) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of np. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992.
A Lower-Bound Result on the Power of a Genetic Algorithm - Park (1993) (1 citation) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of np. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992.
Algorithmic Construction of Sets for k-Restrictions.. - Alon, Moshkovitz, Safra (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70--122, 1998.
Computer Assisted Proof of Optimal Approximability Results - Zwick (2002) (1 citation) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45:70--122, 1998.
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Proceedings of the Thirty Third Annual Symposium on the Foundations of Computer Science, IEEE, 1992.
The Primal-Dual Method for Approximation Algorithms - Williamson (4 citations) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45:70--122, 1998.
The Primal-Dual Method for Approximation Algorithms - Williamson (4 citations) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs; a new characterization of NP. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 2--13, 1992.
Claire Kenyon's research statement - Kenyon (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs : a new characterization of NP. In Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, pp 2-13, 1992.
Claire Kenyon's Statement of Purpose - Kenyon (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs : a new characterization of NP. In Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, pp 2-13, 1992.
Pseudorandomness and Average-case Complexity via Uniform.. - Trevisan, Vadhan (2002) (5 citations) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. J. ACM, 45(1):70--122, 1998. Preliminary version in Proc. of FOCS'92.
Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate.. - Holmerin (2001) (5 citations) (Correct)
No context found.
Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, January 1998.
A 7/8-Approximation Algorithm for MAX 3SAT? (Extended Abstract) - Karloff, Zwick (1997) (Correct)
No context found.
S. Arora and M. Safra. Probabilistic checking of proofs: a new characterization of NP. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, pages 2--13, 1992.
The PCP theorem and hardness of - Approximation Uriel Feige (Correct)
No context found.
S. Arora, S. Safra. "Probabilistic checking of proofs: a new characterization of NP". JACM 45(1): 70--122 (1998).
Lecturer: Madhu Sudan Scribe: Ryan O'Donnell - Error Correcting Codes (Correct)
No context found.
Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, January 1998.
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin .. - Gutfreund, Shaltiel, al. (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70--122, 1998.
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (9 citations) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Proceedings of the Thirty Third Annual Symposium on the Foundations of Computer Science, IEEE, 1992.
A Complete Problem for Statistical Zero Knowledge - Sahai, Vadhan (2002) (Correct)
No context found.
Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, January 1998.
Refining Randomness - Ta-Shma (1996) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs; a new characterization of NP. In Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science, pages 2--13, 1992.
Some Results on Derandomization - Buhrman, Fortnow, Pavan (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70--122, January 1998.
Some Applications of Coding Theory in Computational Complexity - Trevisan (2004) (Correct)
No context found.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70--122, 1998. Preliminary version in Proc. of FOCS'92.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC