Definitions from Wikipedia (MAXEkSAT)

▸ noun:  a problem in computational complexity theory that is a maximization version of the Boolean satisfiability problem 3SAT.


▸ Words similar to maxeksat
▸ Usage examples for maxeksat

▸ Idioms related to maxeksat
▸ Wikipedia articles (New!)
▸ Popular adjectives describing maxeksat
▸ Words that often appear near maxeksat
▸ Rhymes of maxeksat

▸ Invented words related to maxeksat