“Inapproximability results for SAT and other problems”
E124291
UNEXPLORED
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
Johan Håstad
→
|
notableWork |