An exponential separation between regular and general resolution

: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems was quasi-polynomial. ACM Classification: F.2.2, F.2.3 AMS Classification: 03F20, 68Q17 Key words and phrases: resolution, proof complexity, lower bounds

• Type: Conference
• Year: 2002
• Where: STOC
• Authors: Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
• Keywords: Algorithms, Distinct Proofs, Key Words, Proof Complexity, STOC 2002