Login / Signup
Polynomial Calculus for Quantified Boolean Logic: Lower Bounds through Circuits and Degree.
Olaf Beyersdorff
Kaspar Kasche
Luc Nicolas Spachmann
Published in:
Electron. Colloquium Comput. Complex. (2024)
Keyphrases
</>
boolean logic
lower bound
upper bound
low degree
truth values
branch and bound
objective function
optimal solution
vc dimension
high speed
average case complexity
databases
np hard
lower and upper bounds