SAT stands for the Boolean satisfiability problem.
The tag sat refers to SAT, the Boolean satisfiability problem.
About
Stats
|
created |
13 years, 3 months ago by Evgenij Thorstensen |
|
viewed |
47 times |
|
active |
13 years ago |
|
editors |
1 |
Top Answerers
more »
Recent Hot Answers
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?
Do any quantum algorithms improve on classical SAT?
Theoretical explanations for practical success of SAT solvers?
Theoretical explanations for practical success of SAT solvers?
more »