S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 14--23, 1992. Pittsburgh, PA. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Parameterized Complexity for the Skeptic - Downey (2003) (15 citations) (Correct)
....into trying to combat intractability. As per Garey and Johnson [GJ79] polynomial time approximation schemes (PTAS s) are one of the main traditional methods. Many ingenious polynomial time approximation schemes have been invented for this reason. Often the wonderful PCP theorem of Arora et al. [ALMSS92] shows that no such approximation exists. But sometimes they do. Let s look at some recent examples, taken from some recent major conferences such as STOC, FOCS and SODA, etc. Arora [Ar96] gave a O(n 3000 ) PTAS for EUCLIDEAN TSP Chekuri and Khanna [CK00] gave a O(n 12(log(1= ....
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, "Proof Verification and Intractability of Approximation Algorithms," Proceedings of the IEEE (1992).
Computational Tractability: The View From Mars - Downey, Fellows, Stege (10 citations) (Correct)
....schemes were found for NP complete problems such as Bin Packing and Knapsack. The program has attracted an enormous amount of effort. However, apart from a few similar results on problems mostly of this same general flavor, it now seems to be clear, on the basis of powerful new proof techniques [ALMSS92], that these results are not typical for NP hard and otherwise intractable problems. The vast majority of natural NP hard optimization problems do not admit efficient approximation schemes under the usual assumptions (such as P 6= NP ) While approximation allows for the clever deployment of ....
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, "Proof Verification and Intractability of Approximation Algorithms," Proceedings of the IEEE Symposium on the Foundations of Computer Science, 13--22, 1992.
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results Self-citation (Sudan) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. Proceedings of the Thirty Third Annual Symposium on the Foundations of Computer Science, IEEE, 1992.
Randomness-efficient Low Degree Tests and Short PCPs via.. - Ben-Sasson, Sudan, al. Self-citation (Sudan) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Intractability of Approximation Problems. JACM, Vol. 45, pages 501--555, 1998.
Randomness-efficient Low Degree Tests and Short PCPs via.. - Ben-Sasson, Sudan, al. (2003) Self-citation (Sudan) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Intractability of Approximation Problems. JACM, Vol. 45, pages 501--555, 1998.
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (9 citations) Self-citation (Sudan) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. Proceedings of the Thirty Third Annual Symposium on the Foundations of Computer Science, IEEE, 1992.
Locally Testable Codes and PCPs of almost-Linear Length - Goldreich, Sudan (2004) (3 citations) Self-citation (Sudan) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Intractability of Approximation Problems. JACM, Vol. 45, pages 501--555, 1998.
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich, Sudan (1995) (9 citations) Self-citation (Sudan) (Correct)
No context found.
S. ARORA, C. LUND, R. MOTWANI, M. SUDAN AND M. SZEGEDY. Proof verification and intractability of approximation problems. FOCS 1992. In a typical application, r = O(logn) and one sets k to be a large multiple of r. The FGLSS-graph corresponding to the resulting pcp system will have
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results Self-citation (Sudan) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. Proceedings of the Thirty Third Annual Symposium on the Foundations of Computer Science, IEEE, 1992.
Locally Testable Codes and PCPs of Almost-Linear Length - Preliminary Version Oded Self-citation (Sudan) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Intractability of Approximation Problems. JACM, Vol. 45, pages 501--555, 1998.
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (9 citations) Self-citation (Sudan) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. Proceedings of the Thirty Third Annual Symposium on the Foundations of Computer Science, IEEE, 1992.
Geometric and Dynamic Sensing: Observation of Pose and Motion.. - Jia (1997) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 14--23, 1992. Pittsburgh, PA.
Metafinite Model Theory - Erichgradel Yuri Gurevich (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and intractability of approximation problems, Proceedings of 33rd IEEE Symposium on Foundations of Computer Science (1992), 210--214.
Metafinite Model Theory - Erich Gradel Yuri (1995) (1 citation) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and intractability of approximation problems, Proceedings of 33rd IEEE Symposium on Foundations of Computer Science (1992), 210--214.
Zero Knowledge and the Chromatic Number - Uriel Feige Joe (1996) (90 citations) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 13--22, 1992.
Claire Kenyon's Statement of Purpose - Kenyon (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, pp 13-22, 1992.
Intractability Results for Certain Graph-Theoretic Optimization .. - Venkatesan (1997) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and intractability of approximation problems, Proc. 33 rd IEEE Symposium on Foundations of Computer Science, (1992), pp 13-22.
Some String Problems in Computational Biology - Lanctot (2004) (1 citation) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and intractability of approximation problems. In Proc. of 33rd FOCS, 13-22, 1992.
A PTAS for the Minimization of Polynomials of Fixed.. - De Klerk, Laurent.. (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedi. Proof verification and intractability of approximations problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Science Press, Los Alamitos, CA, pp 14--23, 1992.
On the Hardness of Approximating Minimum Vertex Cover - Dinur, Safra (2004) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. J. ACM, 45(3):501--555, 1998.
The Importance of Being Biased - Dinur, Safra (2002) (23 citations) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 13--22, 1992.
Feasible Proofs and Computations: Partnership and Fusion - Alexander Razborov Institute (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 13--22, 1992.
A PTAS for the Minimization of Polynomials of Fixed.. - De Klerk, Laurent.. (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedi. Proof verification and intractability of approximations problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Science Press, Los Alamitos, CA, pp 14--23, 1992.
The Importance of Being Biased - Dinur, Safra (2002) (23 citations) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 13--22, 1992.
On the Hardness of Approximating k-Dimensional Matching - Hazan Safra And (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 13--22, 1992.
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