![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 31 matches
- 2001
- Manindra Agrawal:
Towards Uniform AC0 - Isomorphisms. CCC 2001: 13-20 - Eric Allender, David A. Mix Barrington, William Hesse:
Uniform Circuits for Division: Consequences and Problems. CCC 2001: 150-159 - Eric Allender, Michal Koucký
, Detlef Ronneburger, Sambuddha Roy, V. Vinay:
Time-Space Tradeoffs in the Counting Hierarchy. CCC 2001: 295-302 - Noga Alon, Richard Beigel:
Lower Bounds for Approximations by Low Degree Polynomials Over Zm. CCC 2001: 184-187 - Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan:
Hausdorff Dimension in Exponential Time. CCC 2001: 210-217 - Luis Antunes, Lance Fortnow, Dieter van Melkebeek:
Computational Depth. CCC 2001: 266-273 - Albert Atserias, Nicola Galesi, Pavel Pudlák:
Monotone Simulations of Nonmonotone Proofs. CCC 2001: 36-41 - Paul Beame
, Russell Impagliazzo
, Ashish Sabharwal:
Resolution Complexity of Independent Sets in Random Graphs. CCC 2001: 52-68 - Amos Beimel, Yuval Ishai:
On the Power of Nonlinear Secrect-Sharing. CCC 2001: 188-202 - Eli Ben-Sasson, Nicola Galesi:
Space Complexity of Random Formulae in Resolution. CCC 2001: 42-51 - Beate Bollig, Martin Sauerhoff, Ingo Wegener:
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. CCC 2001: 172-183 - Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer
, Frédéric Magniez, Miklos Santha, Ronald de Wolf:
Quantum Algorithms for Element Distinctness. CCC 2001: 131-137 - Harry Buhrman, Ronald de Wolf:
Communication Complexity Lower Bounds by Polynomials. CCC 2001: 120-130 - Richard Chang, Jon S. Squire:
Bounded Query Functions with Limited Output Bits. CCC 2001: 90-98 - Jack Jie Dai:
A Stronger Kolmogorov Zero-One Law for Resource-Bounded Measure. CCC 2001: 204-209 - Stefan S. Dantchev, Søren Riis
:
Tree Resolution Proofs of the Weak Pigeon-Hole Principle. CCC 2001: 69-75 - Jürgen Forster:
A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity. CCC 2001: 100-106 - Lance Fortnow:
Comparing Notions of Full Derandomization. CCC 2001: 28-34 - Péter Gács:
Quantum Algorithmic Entropy. CCC 2001: 274-283 - Johan Håstad, Avi Wigderson:
Simple Analysis of Graph Tests for Linearity and PCP. CCC 2001: 244-254 - Russell Impagliazzo
, Valentine Kabanets, Avi Wigderson:
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. CCC 2001: 2-12 - Michal Koucký:
Universal Traversal Sequences with Backtracking. CCC 2001: 21-27 - Elchanan Mossel, Christopher Umans:
On the Complexity of Approximating the VC Dimension. CCC 2001: 220-225 - Andrei A. Muchnik, Nikolai K. Vereshchagin
:
Logical Operations and Kolmogorov Complexity II. CCC 2001: 256-265 - Aduri Pavan, Alan L. Selman:
Separation of NP-Completeness Notions. CCC 2001: 78-89 - Rahul Santhanam:
On Separators, Segregators and Time versus Space. CCC 2001: 286-294 - Rocco A. Servedio, Steven J. Gortler:
Quantum versus Classical Learnability. CCC 2001: 138-148 - Ronen Shaltiel:
Towards Proving Strong Direct Product Theorems. CCC 2001: 107-117 - Amir Shpilka
:
Affine Projections of Symmetric Polynomials. CCC 2001: 160-171 - Larry J. Stockmeyer, Dharmendra S. Modha:
Links Between Complexity Theory and Constrained Block Coding. CCC 2001: 226-243
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-07-07 04:44 CEST 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