A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution

d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and is applicable to DNFs with small conjunctions. We use this to prove lower bounds for the Res(k) propositional proof system, an extension of resolution which works with k-DNFs instead of clauses. We also obtain an exponential separation between depth d circuits of bottom fan-in k and depth d circuits of bottom fan-in

• Type: Conference
• Year: 2002
• Where: FOCS
• Authors: Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo
• Keywords: Buss Russell Impagliazzo‡, FOCS 2002, Nathan Segerlind∗ Sam, Propositional Proof System, Theoretical Computer Science