Lower bounds for the polynomial calculus and the Grobner basis algorithm. (1999)

by Russell Impagliazzo, Pavel Pudlak, Jiri Sgall
Venue:Computational Complexity,