|
This article is cited in 21 scientific papers (total in 21 papers)
Pseudorandom generators hard for $k$-DNF resolution and polynomial calculus resolution
A. A. Razborovab a Institute for Advanced Study, Princeton, NJ, On leave from Steklov Mathematical Institute, Moscow, Russia
b Department of Computer Science, University of Chicago, Chicago, IL
Received: 19.03.2003 Revised: 28.05.2014 Accepted: 28.08.2014
Linking options:
https://www.mathnet.ru/eng/aom1
|
Statistics & downloads: |
Abstract page: | 168 |
|