Login / Signup
Polynomial Calculus for Quantified Boolean Logic: Lower Bounds Through Circuits and Degree.
Olaf Beyersdorff
Tim Hoffmann
Kaspar Kasche
Luc Nicolas Spachmann
Published in:
MFCS (2024)
Keyphrases
</>
boolean logic
lower bound
upper bound
low degree
truth values
objective function
high speed
worst case
branch and bound
lower and upper bounds
optimal solution
database systems
hidden markov models
logic programming
average case complexity