S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 14--23, 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Probabilistically Checkable Debate Systems and - Approximation Algorithms For (1993) Self-citation (Lund) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Hardness of Approximation Problems, Proc. 33rd Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1992, pp. 14--23.
Energy Minimization via Graph Cuts: Settling What is Possible - Daniel Freedman And (1 citation) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 14--23, 1992.
New Upper Bounds for Maximum Satisfiability - Niedermeier, Rossmanith (2000) (3 citations) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the 33d IEEE Symposium on Foundations of Computer Science, pages 14--23, 1992.
Confronting Hardness Using a Hybrid Approach - Vassilevska, Williams, Woo (2005) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501--555, 1998.
Graph Algorithms for Planning and Partitioning - Chawla (2005) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501--555, 1998.
Hardness of the Edge-Disjoint Paths Problem with Congestion - Andrews, Zhang (2005) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501--555, 1998.
Hardness of the Undirected Congestion Minimization Problem - Andrews, Zhang (2004) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501--555, 1998.
On Structural Properties of the Market Graph - Boginski, Butenko, Pardalos (2003) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Szegedy, Proof verification and hardness of approximation problems, Journal of the ACM 45 (1998) 501-555.
A Randomized Approximation Scheme for Metric MAX-CUT - Vega, Kenyon (2001) (17 citations) (Correct)
No context found.
R. M. M. S. S. Arora, C. Lund and M. Szegedy. Proof verification and hardness of approximation problems. Proc. 33 rd IEEE Foundations of Computer Science (FOCS), pages 24-- 35.
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (389 citations) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 14--23, 1992.
CATS: Certified Authenticated Tamper-evident State Store.. - Yumerefendi, Chase (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof Verification and Hardness of Approximation Problems. In IEEE Symposium on Foundations of Computer Science, pages 14--23, 1992.
Computer Assisted Proof of Optimal Approximability Results - Zwick (2002) (1 citation) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45:501--555, 1998.
The Primal-Dual Method for Approximation Algorithms - Williamson (4 citations) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45:501--555, 1998.
The Primal-Dual Method for Approximation Algorithms - Williamson (4 citations) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 14--23, 1992.
Pseudorandomness and Average-case Complexity via Uniform.. - Trevisan, Vadhan (2002) (5 citations) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. J. ACM, 45(3):501--555, 1998. Preliminary version in Proc. of FOCS'92.
Empirical and Analytic Approaches to Understanding Local Search.. - Carson (2001) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Hardness of Approximation Problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 14--23, 1992.
Complexity Theory - Allender, Loui, Regan (2004) (Correct)
No context found.
Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. 1998. Proof verification and hardness of approximation problems. J. ACM 45(3):501--555.
Making Games Short (Extended Abstract) - Feige, Kilian (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy. "Proof verification and hardness of approximation problems." Proc. 33rd FOCS, IEEE 1992, pp. 14--23.
Tree Edit Distance, Alignment Distance and Inclusion - Bille (2003) (Correct)
No context found.
A. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the 33rd IEEE Symposium on the Foundations of Computer Science (FOCS), pages 14--23, 1992.
Hardness of Approximation for Vertex-Connectivity.. - Kortsarz, Krauthgamer, .. (2003) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501--555, 1998.
Polylogarithmic-round Interactive Proofs for coNP Collapse.. - Selman, Sengupta (2004) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 14--22. IEEE Computer Society Press, 1992.
Lower Bounds for the Relative Greedy Algorithm for.. - Hougardy, Kirchner (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, J. ACM 45 (1998), 501--555.
The PCP theorem and hardness of - Approximation Uriel Feige (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy. "Proof verification and hardness of approximation problems". JACM 45(3): 501--555 (1998).
On the Algorithmic Tractability of Single Nucleotide.. - Wernicke (2003) (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45:501-555,
On Approximation Algorithms - For The Terminal (Correct)
No context found.
S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, 33rd FOCS 1992, pp. 14--23.
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