Work

Free bits, PCPs and non-approximability-towards tight results

Year: 2002

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1995.492573

Authors: M. Bellare, O. Goldreich, M. Sudan

Institutions: University of California San Diego, Weizmann Institute of Science, IBM Research - Thomas J. Watson Research Center

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2202947145

FWCI: 17.5

Cites: 88

Cited by: 274

Related to: 9