## Pseudorandom Generators Hard for k-DNF Resolution and Polynomial Calculus Resolution (2003)

by
Alexander A. Razborov

Citations: | 39 - 4 self |

### BibTeX

@TECHREPORT{Razborov03pseudorandomgenerators,

author = {Alexander A. Razborov},

title = {Pseudorandom Generators Hard for k-DNF Resolution and Polynomial Calculus Resolution},

institution = {},

year = {2003}

}

### Years of Citing Articles

### OpenURL

### Abstract

A pseudorandom generator G n : f0; 1g is hard for a propositional proof system P if (roughly speaking) P can not ef- ciently prove the statement G n (x 1 ; : : : ; x n ) 6= b for any string b 2 . We present a function (m 2 ) generator which is hard for Res( log n); here Res(k) is the propositional proof system that extends Resolution by allowing k-DNFs instead of clauses.