Omega(n log n) Lower Bounds on Length of Boolean Formulas.
Michael J. FischerAlbert R. MeyerMike PatersonPublished in: SIAM J. Comput. (1982)
Keyphrases
- lower bound
- boolean formula
- upper bound
- max sat
- unsatisfiable cores
- worst case
- branch and bound algorithm
- np hard
- branch and bound
- sat solvers
- practical problems
- equivalence queries
- objective function
- conjunctive normal form
- boolean variables
- np complete
- optimal solution
- logic programs
- machine learning
- boolean functions
- linear constraints