default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 10
Volume 10, Number 1, 2001
- Amir Shpilka
, Avi Wigderson:
Depth-3 arithmetic circuits over fields of characteristic zero. 1-27 - Hana Chockler, Uri Zwick:
Which bases admit non-trivial shrinkage of formulae? 28-40 - Mark Giesbrecht:
Fast computation of the Smith form of a sparse integer matrix. 41-69 - Christoph Meinel, Stephan Waack:
The "log rank" conjecture for modular communication complexity. 70-91
Volume 10, Number 2, 2001
- Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet:
Two oracles that force a big crunch. 93-116 - Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich:
Reducing the complexity of reductions. 117-138 - Dima Grigoriev:
Complexity of Positivstellensatz proofs for the knapsack. 139-154 - Martin Sauerhoff:
On the size of randomized OBDDs and read-once branching programs for k-stable functions. 155-178
Volume 10, Number 3, 2001
- Søren Riis:
A complexity gap for tree resolution. 179-209 - Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jirí Sgall:
Communication complexity towards lower bounds on circuit depth. 210-246 - Chi-Jen Lu:
Derandomizing Arthur-Merlin games under uniform assumptions. 247-259
Volume 10, Number 4, December 2001
- Maria Luisa Bonet, Nicola Galesi:
Optimality of size-width tradeoffs for resolution. 261-276 - Anna Gál:
A characterization of span program size and improved lower bounds for monotone span programs. 277-296 - Matthias Krause, Stefan Lucks:
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. 297-313 - Ilan Kremer, Noam Nisan, Dana Ron:
Errata for: "On randomized one-round communication complexity". 314-315
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 2025-12-05 22:23 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:
