Polynomial Calculus for Quantified Boolean Logic: Lower Bounds Through Circuits and Degree.

Olaf Beyersdorff, Tim Hoffmann, Kaspar Kasche, Luc Nicolas Spachmann

Browse the full MFCS paper archive.