Hard Satisfiable Formulas for Splittings by Linear Combinations.
Dmitry ItsyksonAlexander KnopPublished in: SAT (2017)
Keyphrases
- linear combination
- random sat
- truth assignment
- phase transition
- randomly chosen
- cnf formula
- small number
- propositional formulas
- satisfiability problem
- basis functions
- sat problem
- sparse coding
- weighted sum
- locally linear
- random instances
- conjunctive normal form
- propositional logic
- randomly generated
- np complete
- sparse approximation
- multiscale
- max sat