default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 11
Volume 11, Numbers 1-2, June 2002
- Oded Goldreich
, Salil P. Vadhan, Avi Wigderson:
On interactive proofs with a laconic prover. 1-53 - Carsten Damm, Markus Holzer, Pierre McKenzie:
The complexity of tensor calculus. 54-89
Volume 11, Numbers 3-4, June 2002
- Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi:
Homogenization and the polynomial calculus. 91-108 - Eli Ben-Sasson:
Hard examples for the bounded depth Frege proof system. 109-136 - Lance Fortnow, John D. Rogers:
Separability and one-way functions. 137-157 - Bruno Codenotti, Igor E. Shparlinski, Arne Winterhof:
On the hardness of approximating the permanent of structured matrices. 158-170
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:
