Optimal algorithms and inapproximability results for every CSP?

Prasad Raghavendra

misc2008

Citation key: Raghavendra2008CSP
Year: 2008
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Prasad Raghavendra, “Optimal algorithms and inapproximability results for every CSP?” Proceedings of STOC 2008, 245–254, DOI: 10.1145/1374376.1374414.

Catalog connections

Conjectures citing this source

TCS-008Unique Games ConjectureTheoretical computer science

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Prasad Raghavendra
doi: 10.1145/1374376.1374414
note: Prasad Raghavendra, “Optimal algorithms and inapproximability results for every CSP?” Proceedings of STOC 2008, 245--254, DOI: 10.1145/1374376.1374414.
title: Optimal algorithms and inapproximability results for every CSP?
year: 2008