Title of article
Exponential separation between Res(k) and Res(k+1) for k logn
Author/Authors
Nathan Segerlind، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2005
Pages
6
From page
185
To page
190
Keywords
Switching lemmas , Random restrictions , resolution , Theory ofcomputation , computational complexity , lower bounds , Res(k) , k-DNFs , Propositional proof complexity
Journal title
Information Processing Letters
Serial Year
2005
Journal title
Information Processing Letters
Record number
130033
Link To Document