| Information | |
|---|---|
| has gloss | eng: MAX-3SAT is a problem in the computational complexity subfield of computer science. It generalises the Boolean satisfiability problem (SAT) which is a decision problem considered in complexity theory. It is defined as: |
| lexicalization | eng: MAX-3SAT |
| lexicalization | eng: MAX3SAT |
| instance of | c/NP-hard problems |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint