| Information | |
|---|---|
| has gloss | eng: MAXEkSAT is a problem in computational complexity theory that is a maximization version of the Boolean satisfiability problem 3SAT. |
| lexicalization | eng: MAXEkSAT |
| instance of | c/NP-hard problems |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint