Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution.

Olaf Beyersdorff Joshua Blinkhorn Meena Mahajan

Published in: LICS (2020)

Keyphrases

lower bound
np hard
worst case
computational complexity
upper bound
branch and bound algorithm
objective function
high resolution
phase transition
image resolution
running times
information theoretic
branch and bound
lower and upper bounds
fixed parameter tractable
optimal cost
optimal solution