Lower Bound Techniques for QBF Expansion.
Olaf BeyersdorffJoshua BlinkhornPublished in: Theory Comput. Syst. (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- optimal solution
- quantified boolean formulas
- objective function
- worst case
- np hard
- linear programming relaxation
- upper and lower bounds
- lower bounding
- orders of magnitude
- linear programming
- max sat
- online algorithms
- sufficiently accurate