Towards lower bounds for bounded-depth Frege proofs with modular connectives.
Alexis MacielToniann PitassiPublished in: Proof Complexity and Feasible Arithmetics (1996)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- inference rules
- sequent calculus
- objective function
- branch and bound
- lower and upper bounds
- optimal solution
- np hard
- upper and lower bounds
- theorem prover
- online algorithms
- vc dimension
- depth map
- theorem proving
- depth images
- randomly generated problems
- formal proofs
- knapsack problem
- first order logic
- asymptotically optimal
- theoretical analysis
- lower bounding
- worst case
- polynomial approximation
- modular neural networks