In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimizationâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Review

2016

Review

2016

- Subhash Khot
- ICALP
- 2016

This article accompanies the talk given by the author at the International Congress of Mathematicians, 2014. The article sketchesâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Atish Das Sarma, Stephan Holzer, +5 authors Roger Wattenhofer
- STOC
- 2011

We study the <i>verification</i> problem in distributed networks, stated as follows. Let H be a subgraph of a network G whereâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Samuel Safra
- 2004

We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCPâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Michael Alekhnovich
- computational complexity
- 2003

We consider the problem to determine the maximal number of satisfiable equations in a linear system chosen at random. We makeâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Uriel Feige
- STOC
- 2002

We investigate relations between average case complexity and the complexity of approximation. Our preliminary findings indicateâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Guy Kortsarz, Robert Krauthgamer, James R. Lee
- APPROX
- 2002

In the survivable network design problem (SNDP), the goal is to find a minimum-cost spanning subgraph satisfying certainâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
- J. ACM
- 1998

We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number ofâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Erez Petrank
- computational complexity
- 1993

We refine the complexity analysis of approximation problems by relating it to a new parameter calledgap location. Many of theâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
- FOCS
- 1992

The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine thatâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Sanjeev Arora, Carsten Lundy, Rajeev Motwaniz, Madhu Sudanx, Mario Szegedy
- 1992

The class PCP(f(n); g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine thatâ€¦Â (More)

Is this relevant?