MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Proof verification and the hardness of approximation problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

Proof verification and hardness of approximation problems
by Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy — 1992 — In Proc. 33rd Ann. IEEE Symp. on Found. of Comp. Sci
…Proof Verification and the Hardness of Approximation Problems Sanjeev Arora ∗ Carsten Lund…
Cited by 513 (31 self) – Add To MetaCart

Awards
by Madhu Sudan — 2005
…, Madhu Sudan, and Mario Szegedy, “Proof verification and the hardness of approximation problems,” Journal…
Add To MetaCart

Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric
by Richard Mayr, Annette Schelten
… to the NP-hard problems which have a PTAS, Christofides' approximation algorithm was the best known…
Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB