On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report).
Harry B. Hunt IIIRichard Edwin StearnsPublished in: AAECC (1988)
Keyphrases
- satisfiability problem
- algebraic structures
- pspace complete
- np complete
- phase transition
- search algorithm
- temporal logic
- stochastic local search
- random sat
- sat problem
- computational complexity
- mazurkiewicz traces
- stochastic local search algorithms
- solving hard
- np hard
- bounded treewidth
- davis putnam
- sat instances
- max sat
- inductive inference
- partially ordered sets