Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices.
Oliver KullmannPublished in: SAT (2007)
Keyphrases
- boolean formula
- special case
- satisfiability testing
- decision making
- satisfiability problem
- search space
- affine invariant
- search algorithm
- cnf formula
- decision makers
- sat solvers
- phase transition
- decision problems
- sat problem
- decision rules
- gaussian curvature
- finite sets
- approximation algorithms
- search strategies
- propositional satisfiability
- computational complexity
- boolean satisfiability
- boolean variables
- orders of magnitude