Annals of Mathematics. Second Series
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Main page
About this project
Software
Classifications
Links
Terms of Use

Search papers
Search references

RSS
Current issues
Archive issues
What is RSS






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Annals of Mathematics. Second Series, 2015, Volume 181, Issue 2, Pages 415–472
DOI: https://doi.org/10.4007/annals.2015.181.2.1
(Mi aom1)
 

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
Citations (21)
Funding agency Grant number
Russian Foundation for Basic Research 02-02-01290
Supported by The State of New Jersey and by the RFBR grant 02-02-01290.
Received: 19.03.2003
Revised: 28.05.2014
Accepted: 28.08.2014
Bibliographic databases:
Document Type: Article
Language: English
Linking options:
  • https://www.mathnet.ru/eng/aom1
  • This publication is cited in the following 21 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:168
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024