Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives.
Alexis MacielToniann PitassiPublished in: LICS (2006)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- inference rules
- constant factor
- lower and upper bounds
- np hard
- worst case
- sequent calculus
- arbitrarily close
- theorem prover
- linear programming relaxation
- theorem proving
- lower bounding
- optimal solution
- natural deduction
- depth information
- formal proof
- mathematical proofs
- multiscale
- depth map
- dynamic programming
- equational theories