ConceptBoolean Satisfiability Problem / SAT
SAT Problem
The classic computational problem of determining whether a given Boolean formula has a satisfying assignment. It is the first problem proven to be NP-complete.
Timeline (last 90 days)
Nov 3
The SAT problem is an NP-complete problem: given a Boolean formula, determine whether there exists an assignment of variables that makes the formula true.
Unverified50%
Nov 2
We do not know any super-linear lower bound for the SAT problem.
Unverified50%
Sep 2
The Cook-Levin theorem proves that the SAT problem is NP-complete.
Unverified50%
All Facts (3)
Unverified
The SAT problem is an NP-complete problem: given a Boolean formula, determine whether there exists an assignment of variables that makes the formula true.
50%UnverifiedWe do not know any super-linear lower bound for the SAT problem.
50%UnverifiedThe Cook-Levin theorem proves that the SAT problem is NP-complete.
50%