default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Colloquium on Computational Complexity, 1994
Volume TR94, 1994
- Noam Nisan, Avi Wigderson:
On Rank vs. Communication Complexity. Article TR94-001 - Oded Goldreich, Avi Wigderson:
Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing. Article TR94-002 - Noam Nisan, Amnon Ta-Shma:
Symmetric Logspace is Closed Under Complement. Article TR94-003 - Eric Allender, Martin Strauss:
Measure on Small Complexity Classes, with Applications for BPP. Article TR94-004 - Noga Alon, Alan M. Frieze, Dominic Welsh:
Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Article TR94-005 - Alexander A. Razborov:
On provably disjoint NP-pairs. Article TR94-006 - Oded Goldreich, Rafail Ostrovsky, Erez Petrank:
Computational Complexity and Knowledge Complexity. Article TR94-007 - Oded Goldreich:
Probabilistic Proof Systems (A Survey). Article TR94-008 - Noga Alon, Raphael Yuster, Uri Zwick:
Color-Coding. Article TR94-009 - Alexander A. Razborov, Steven Rudich:
Natural Proofs. Article TR94-010 - Richard Beigel, William Hurwood, Nabil Kahalé:
Fault Diagnosis in a Flash. Article TR94-011 - Wolfgang Maass:
Bounds for the Computational Power and Learning Complexity of Analog Neural Nets. Article TR94-012 - Pavel Pudlák:
Complexity Theory and Genetics (extended abstract). Article TR94-013 - Miklós Ajtai:
The Independence of the modulo p Counting Principles. Article TR94-014 - Miklós Ajtai:
Symmetric Systems of Linear Equations modulo p. Article TR94-015 - Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu:
Efficient Average-Case Algorithms for the Modular Group. Article TR94-016 - Wolfgang Maass:
Neural Nets with Superlinear VC-Dimension. Article TR94-017 - Jan Krajícek, Pavel Pudlák, Alan R. Woods:
An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle. Article TR94-018 - Wolfgang Maass:
Lower Bounds for the Computational Power of Networks of Spiking Neurons. Article TR94-019 - Wolfgang Maass:
Agnostic PAC-Learning of Functions on Analog Neural Nets. Article TR94-020 - Lance Fortnow:
My Favorite Ten Complexity Theorems of the Past Decade. Article TR94-021 - Christoph Meinel, Stephan Waack:
The Möbius Function, Variations Ranks, and Theta(n)-Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem. Article TR94-022 - Matthias Krause, Pavel Pudlák:
On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates. Article TR94-023 - Marek Karpinski, Angus Macintyre:
Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks. Article TR94-024 - David P. Dobkin, Dimitrios Gunopulos, Wolfgang Maass:
Computing the Maximum Bichromatic Discrepancy, with applications to Computer Graphics and Machine Learning. Article TR94-025 - Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener:
On the Power of Different Types of Restricted Branching Programs. Article TR94-026 - Stasys Jukna:
A Note on Read-k Times Branching Programs. Article TR94-027
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 2026-06-20 00:09 CEST 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:
