A Feasibly Constructive Lower Bound for Resolution Proofs.
Stephen A. CookToniann PitassiPublished in: Inf. Process. Lett. (1990)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- theorem proving
- optimal solution
- np hard
- high resolution
- sufficiently accurate
- formal proof
- consequence finding
- low resolution
- worst case
- upper and lower bounds
- lower bounding
- sample complexity
- search space
- lagrangian relaxation
- sampling rate
- polynomial approximation
- equational theories