| Information | |
|---|---|
| has gloss | eng: In computational complexity theory, (SAT, ε-UNSAT) is a language that is used in the proof of the PCP theorem, which relates the language NP to probabilistically checkable proof systems. |
| lexicalization | eng: (SAT, e-UNSAT) |
| lexicalization | eng: (SAT, ε-UNSAT) |
| instance of | e/NP-complete |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint