Lower Bounds Against PC With Extension Variables

Visit talk page

Random log(n)-CNF are Hard for Cutting Planes (Again)

Visit talk page

The Hitting Proof System

Visit talk page

A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion

Visit talk page

Lifting to Parity Decision Trees via Stifling (with applications to proof complexity)

Visit talk page

Consistency of NEXP Not in P/poly in a Strong Theory

Visit talk page

Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic

Visit talk page

Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic

Visit talk page

Towards P≠NP from Extended Frege Lower Bounds

Visit talk page

Indistinguishability Obfuscation via Mathematical Proofs of Equivalence

Visit talk page