SAT stands for the Boolean satisfiability problem.
The tag sat refers to SAT, the Boolean satisfiability problem.
Stats
|
created |
9 years, 5 months ago by Evgenij Thorstensen |
|
viewed |
26 times |
|
active |
9 years, 2 months ago |
|
editors |
1 |
Top Answerers
more »
Recent Hot Answers
Constraint satisfaction problem (CSP) vs. satisfiability modulo theory (SMT); with a coda on constraint programmingIs this variation of TQBF still PSPACE-complete?
Do any quantum algorithms improve on classical SAT?
Are there any hard instances of 3-SAT when the clauses can only use literals that are “nearby” each other?
How many tautologies are there?
more »
