default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 5
Volume 5, Number 1, 1995
- Nick Littlestone, Philip M. Long, Manfred K. Warmuth:
On-line Learning of Linear Functions. 1-23 - György Turán:
On the Complexity of Planar Boolean Circuits. 24-42 - Benny Chor, Netta Shani:
The Privacy of Dense Symmetric Functions. 43-59 - Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman:
Derandomized Graph Products. 60-75 - Keju Ma, Joachim von zur Gathen:
The Computational Complexity of Recognizing Permutation Functions. 76-97
Volume 5, Number 2, 1995
- Johan Håstad
, Stasys Jukna, Pavel Pudlák:
Top-Down Lower Bounds for Depth-Three Circuits. 99-112 - Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde:
Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. 113-131 - Alain P. Hiltgen, Mike Paterson:
PIk Mass Production and an Optimal Circuit for the Neciporuk Slice. 132-154 - Carme Àlvarez, Birgit Jenner:
A Note on Logspace Optimization. 155-166 - Meera Sitharam:
Evaluating Spectral Norms for Constant Depth Circuits with Symmetric Gates. 167-189
Volume 5, Number 3/4, 1995
- Mauricio Karchmer, Ran Raz, Avi Wigderson:
Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. 191-204 - Ran Raz:
Fourier Analysis for Probabilistic Communication Complexity. 205-221 - Thomas Lickteig, Kai Werther:
How can a Complex Square Root be Computed in an Optimal Way. 222-236 - Ueli M. Maurer:
On the Oracle Complexity of Factoring Integers. 237-247 - Meera Sitharam:
Pseudorandom Generators and Learning Algorithms for AC^0. 248-266 - David W. Juedes:
Weakly Complete Problems are not Rare. 267-283
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-12 01:08 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:
