Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Search syntax
s:d sort by date
r:uk uk region
site: domain search
\ search first result
More...
r:n turn off region
!a search search amazon
site:uk uk pages
f: find files
t: within title
b: within body
More explanation...
Maximum satisfiability problem
In computational complexity theory, the Maximum Satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula, that can be satisfied by some assignment.
More at Wikipedia
Boolean Satisfiability Problem
Constraint satisfaction
More related topics
Satisfiability Modulo Theories
Satisfiability problems
Combinatorial optimization
Logic in computer science
This page requires Javascript.Get the non-JS version
here
.