Advertisement

Who’s Afraid of Natural Proofs?

Chapter

Abstract

Alexander Razborov is one of the world experts on circuit lower bounds. Perhaps the expert. In 1990 he won the Nevanlinna Prize for his work on lower bounds, more recently in 2007 he won the Gödel Prize (with Steven Rudich) for their beautiful work on “Natural Proofs” (NaP) [117].

Keywords

Boolean Function Monotone Function Complexity Measure Circuit Complexity Impossibility Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Georgia Institute of TechnologyCollege of Computing School of Computer ScienceAtlantaUSA

Personalised recommendations