logo
http://theoryofcomputing.org     ISSN 1557-2862
Endorsed by ACM SIGACT
  • Home
  • Introduction
  • Articles
  • Special Issues
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Articles under category:
Explicit Construction
Volume 6, Article 7 (pages 135-177)
Elusive Functions and Lower Bounds for Arithmetic Circuits
by Ran Raz
Volume 5, Article 3 (pages 69-82)
Unconditional Pseudorandom Generators for Low Degree Polynomials
by Shachar Lovett
Volume 3, Article 6 (pages 103-128)
Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number
by David Zuckerman
Volume 1, Article 8 (pages 149-176)
A Non-linear Time Lower Bound for Boolean Branching Programs
by Miklós Ajtai