default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 13
Volume 13, Numbers 1-2, December 2004
- Valentine Kabanets, Russell Impagliazzo
:
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. 1-46 - Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs. 47-68 - Satoru Kuroda:
Recursion Schemata for Slowly Growing Depth Circuit Classes. 69-89
Volume 13, Number 3-4, February 2005
- Erich L. Kaltofen, Gilles Villard:
On the complexity of computing determinants. 91-130 - Pascal Koiran:
Valiant's model and the cost of computing integers. 131-146 - Emanuele Viola:
The complexity of constructing pseudorandom generators from hard functions. 147-188
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-23 19:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
