Free Bits, PCP and Non-Approximability - Towards Tight Results

@inproceedings{Bellare1995FreeBP,
  title={Free Bits, PCP and Non-Approximability - Towards Tight Results},
  author={Mihir Bellare and Oded Goldreich and Madhu Sudan},
  booktitle={Electronic Colloquium on Computational Complexity},
  year={1995}
}
This paper continues the investigation of the connection between proof systems and approximation. The emphasis is on proving tight non-approximability results via consideration of measures like the \free bit complexity" and the \amortized free bit complexity" of proof systems. The rst part of the paper presents a collection of new proof systems based on a new errorcorrecting code called the long code, and means to test it. We provide a proof system which has amortized free bit complexity of 2… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 116 extracted citations

Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion

Electronic Colloquium on Computational Complexity • 2018
View 3 Excerpts
Highly Influenced

Optimal Long Code Test with One Free Bit

2009 50th Annual IEEE Symposium on Foundations of Computer Science • 2009
View 3 Excerpts
Highly Influenced

A 3-query non-adaptive PCP with perfect completeness

21st Annual IEEE Conference on Computational Complexity (CCC'06) • 2006
View 5 Excerpts
Highly Influenced

On the Unique Games Conjecture (Invited Survey)

2010 IEEE 25th Annual Conference on Computational Complexity • 2005
View 5 Excerpts
Highly Influenced

On the power of unique 2-prover 1-round games

STOC • 2002
View 6 Excerpts
Highly Influenced

Recycling Queries in PCPs and in Linearity Tests

T ESTING L INEARITY
1998
View 9 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Similar Papers

Loading similar papers…