default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 1994
- Noam Nisan, Avi Wigderson:
On Rank vs. Communication Complexity. Electron. Colloquium Comput. Complex. TR94 (1994) - Oded Goldreich, Avi Wigderson:
Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing. Electron. Colloquium Comput. Complex. TR94 (1994) - Noam Nisan, Amnon Ta-Shma:
Symmetric Logspace is Closed Under Complement. Electron. Colloquium Comput. Complex. TR94 (1994) - Eric Allender, Martin Strauss:
Measure on Small Complexity Classes, with Applications for BPP. Electron. Colloquium Comput. Complex. TR94 (1994) - Noga Alon, Alan M. Frieze, Dominic Welsh:
Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Electron. Colloquium Comput. Complex. TR94 (1994) - Alexander A. Razborov:
On provably disjoint NP-pairs. Electron. Colloquium Comput. Complex. TR94 (1994) - Oded Goldreich, Rafail Ostrovsky, Erez Petrank:
Computational Complexity and Knowledge Complexity. Electron. Colloquium Comput. Complex. TR94 (1994) - Oded Goldreich:
Probabilistic Proof Systems (A Survey). Electron. Colloquium Comput. Complex. TR94 (1994) - Noga Alon, Raphael Yuster, Uri Zwick:
Color-Coding. Electron. Colloquium Comput. Complex. TR94 (1994) - Alexander A. Razborov, Steven Rudich:
Natural Proofs. Electron. Colloquium Comput. Complex. TR94 (1994) - Richard Beigel, William Hurwood, Nabil Kahalé:
Fault Diagnosis in a Flash. Electron. Colloquium Comput. Complex. TR94 (1994) - Wolfgang Maass:
Bounds for the Computational Power and Learning Complexity of Analog Neural Nets. Electron. Colloquium Comput. Complex. TR94 (1994) - Pavel Pudlák:
Complexity Theory and Genetics (extended abstract). Electron. Colloquium Comput. Complex. TR94 (1994) - Miklós Ajtai:
The Independence of the modulo p Counting Principles. Electron. Colloquium Comput. Complex. TR94 (1994) - Miklós Ajtai:
Symmetric Systems of Linear Equations modulo p. Electron. Colloquium Comput. Complex. TR94 (1994) - Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu:
Efficient Average-Case Algorithms for the Modular Group. Electron. Colloquium Comput. Complex. TR94 (1994) - Wolfgang Maass:
Neural Nets with Superlinear VC-Dimension. Electron. Colloquium Comput. Complex. TR94 (1994) - 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. Electron. Colloquium Comput. Complex. TR94 (1994) - Wolfgang Maass:
Lower Bounds for the Computational Power of Networks of Spiking Neurons. Electron. Colloquium Comput. Complex. TR94 (1994) - Wolfgang Maass:
Agnostic PAC-Learning of Functions on Analog Neural Nets. Electron. Colloquium Comput. Complex. TR94 (1994) - Lance Fortnow:
My Favorite Ten Complexity Theorems of the Past Decade. Electron. Colloquium Comput. Complex. TR94 (1994) - 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. Electron. Colloquium Comput. Complex. TR94 (1994) - Matthias Krause, Pavel Pudlák:
On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates. Electron. Colloquium Comput. Complex. TR94 (1994) - Marek Karpinski, Angus Macintyre:
Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks. Electron. Colloquium Comput. Complex. TR94 (1994) - David P. Dobkin, Dimitrios Gunopulos, Wolfgang Maass:
Computing the Maximum Bichromatic Discrepancy, with applications to Computer Graphics and Machine Learning. Electron. Colloquium Comput. Complex. TR94 (1994) - Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener:
On the Power of Different Types of Restricted Branching Programs. Electron. Colloquium Comput. Complex. TR94 (1994) - Stasys Jukna:
A Note on Read-k Times Branching Programs. Electron. Colloquium Comput. Complex. TR94 (1994)
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-04 20:14 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint