Under the auspices of the Computational Complexity Foundation (CCF)
This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution.The previous best known separation between these systems wasquasi-polynomial.