Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.
Ludmila GlinskihDmitry ItsyksonPublished in: MFCS (2017)
Keyphrases
- propositional formulas
- max sat
- random sat
- semidefinite
- truth assignment
- sat problem
- cnf formula
- propositional logic
- read once formulas
- satisfiability problem
- phase transition
- randomly chosen
- lower bound
- sat solvers
- search algorithm
- semidefinite programming
- propositional satisfiability
- boolean formula
- random instances
- sat instances
- support vector
- conjunctive normal form
- sufficient conditions
- learning algorithm
- machine learning