Login / Signup
Parameterized Compilation Lower Bounds for Restricted CNF-Formulas.
Stefan Mengel
Published in:
SAT (2016)
Keyphrases
</>
lower bound
cnf formula
max sat
knowledge compilation
upper bound
branch and bound algorithm
branch and bound
np complete
np hard
conjunctive normal form
search algorithm
optimal solution
objective function
sat solvers
vc dimension
sat problem
propositional satisfiability
database