Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas.
Sebastian MüllerIddo TzameretPublished in: Electron. Colloquium Comput. Complex. (2011)
Keyphrases
- average case
- worst case
- cnf formula
- average case complexity
- propositional formulas
- np complete
- theorem prover
- worst case analysis
- propositional logic
- max sat
- uniform distribution
- theorem proving
- first order logic
- lower bound
- np hard
- knowledge compilation
- computational complexity
- vc dimension
- conjunctive normal form
- branch and bound
- simulated annealing
- upper bound
- special case