Lower bounds on Nullstellensatz proofs via designs.
Samuel R. BussPublished in: Proof Complexity and Feasible Arithmetics (1996)
Keyphrases
- lower bound
- upper bound
- branch and bound
- np hard
- theorem proving
- branch and bound algorithm
- objective function
- worst case
- upper and lower bounds
- optimal solution
- lower and upper bounds
- theorem prover
- lower bounding
- design space
- vc dimension
- design principles
- learning algorithm
- linear programming relaxation
- optimal cost
- randomly generated problems
- formal proofs