A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length.
Evgeny DantsinAlexander WolpertPublished in: J. Satisf. Boolean Model. Comput. (2006)
Keyphrases
- search space
- computational cost
- detection algorithm
- optimization algorithm
- computational complexity
- experimental evaluation
- times faster
- np hard
- dynamic programming
- objective function
- theorem prover
- combinatorial optimization
- worst case
- significant improvement
- k means
- minimum length
- total length
- alphabet size
- randomly generated
- segmentation algorithm
- particle swarm optimization
- simulated annealing