The sequence produced by succinct SAT formula can be greatly compressed.

Feng Pan Jie Qi

Published in: CoRR (2015)

Keyphrases

data structure
sat solvers
propositional formulas
search algorithm
computational complexity
input data
data compression
phase transition
satisfiability problem
compressed domain
sat problem
cnf formula
boolean formula
boolean satisfiability