Login / Signup
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution.
Olaf Beyersdorff
Joshua Blinkhorn
Meena Mahajan
Published in:
Electron. Colloquium Comput. Complex. (2020)
Keyphrases
</>
lower bound
np hard
upper bound
computational complexity
worst case
running times
high resolution
branch and bound algorithm
branch and bound
upper and lower bounds
np complete
objective function
information theoretic
low resolution
noise level
lower and upper bounds
optimal solution