Complexity of Satisfiability Problems with Symmetric Polynomial Clauses.
Nadia CreignouMalika MorePublished in: J. Log. Comput. (1997)
Keyphrases
- satisfiability problem
- random sat
- pspace complete
- phase transition
- np complete
- conjunctive normal form
- sat problem
- search algorithm
- temporal logic
- stochastic local search algorithms
- search space
- decision problems
- polynomial size
- propositional formulas
- clause learning
- mazurkiewicz traces
- max sat
- stochastic local search
- randomly generated
- finite domain
- boolean satisfiability
- modal logic
- computational complexity