New answers tagged satisfiability
0
votes
Identifying Variables That Are Always False in Horn-SAT and Enumerating All Solutions
There are no such variables (no variables that are false in every satisfying assignment). The assignment that assigns every variable to true will satisfy every HornSAT formula.
D.W.♦
- 164k
3
votes
Accepted
Can we use XOR's forced branching to show that NP!=P
I suspect you have a misunderstanding about what polynomial time and exponential time mean. When we say "polynomial time", we mean "a polynomial in the length of the input" (i.e., ...
D.W.♦
- 164k
Top 50 recent answers are included
Related Tags
satisfiability × 698complexity-theory × 266
np-complete × 144
3-sat × 116
sat-solvers × 86
reductions × 79
logic × 76
algorithms × 70
np × 45
np-hard × 41
propositional-logic × 37
time-complexity × 36
boolean-algebra × 33
constraint-satisfaction × 32
2-sat × 31
graphs × 29
reference-request × 25
polynomial-time × 25
decision-problem × 23
optimization × 20
p-vs-np × 20
first-order-logic × 16
counting × 14
smt-solvers × 13
circuits × 11