Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas.
Rahul JainHartmut KlauckShengyu ZhangPublished in: COCOON (2010)
Keyphrases
- boolean formula
- lower bound
- max sat
- equivalence queries
- sat solvers
- read once formulas
- worst case
- np complete
- upper bound
- branch and bound algorithm
- practical problems
- unsatisfiable cores
- boolean variables
- branch and bound
- conjunctive normal form
- membership queries
- search algorithm
- np hard
- computational complexity
- linear constraints
- efficient learning
- machine learning
- concept class
- objective function