Skip to Main Content
Log In or Out
Skip to Search

springer.com springerprotocols.com Choose preferred language

SpringerLink

You have Guest access.

What can I do as a guest?

Search

Basic Search Search For All Content

Author or Editor Publication Volume Issue Page

Advanced Search

Content

Search For

Full Text Title & Abstract Title Only

DOI

Author

Editor

Citation

Publication (Title, DOI, ISSN, ISBN)

Volume

Issue

Page

Category and Date Limiters

Content Category

Entire Range of Publication Dates

Select date range Publication Dates Between Start DateANDEnd Date

Order of Results Most Relevant First Most Recently Published First Alphabetical

Share this item
- email
- citeulike
- Connotea
- Delicious
citeulike

Computer Science

Computational Complexity

Volume 1 / 1991 - Volume 20 / 2011

Volume 13, Numbers 1-2 / December 2004

Viewing all 3 articles

Journal
About

Search within

Search Within This Journal

Hide Filters
Show Filters

Browse This Journal

Contemporary Content

Archival Content

About This Journal

Title

Computational Complexity

Coverage

Volume 1 / 1991 - Volume 20 / 2011

Collection

Computer Science

Subjects

ISSN

1016-3328 (Print)
1420-8954 (Online)

Additional Links

Publisher

Birkhäuser Basel

SpringerLink Date

Friday, April 05, 2002

Advertisment

1-46
Original Paper
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Valentine Kabanets and Russell Impagliazzo
- Download PDF (419.5 KB)
47-68
Original Paper
Non-Automatizability of Bounded-Depth Frege Proofs
Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel and Toniann Pitassi
- Download PDF (255.6 KB)
69-89
Original Paper
Recursion Schemata for Slowly Growing Depth Circuit Classes
Satoru Kuroda
- Download PDF (240.9 KB)

Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us

© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info