Остановите войну!
for scientists:
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 121 matches
- 2004
- Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans:
On the complexity of succinct zero-sum games. Electron. Colloquium Comput. Complex. TR04 (2004) - Troy Lee, Dieter van Melkebeek, Harry Buhrman:
Language Compression and Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR04 (2004) - Pascal Koiran:
Valiant's model and the cost of computing integers. Electron. Colloquium Comput. Complex. TR04 (2004) - Ramamohan Paturi, Pavel Pudlák:
Circuit lower bounds and linear codes. Electron. Colloquium Comput. Complex. TR04 (2004) - Stasys Jukna:
On Graph Complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - Günter Hotz:
A remark on nondecidabilities of the initial value problem of ODEs. Electron. Colloquium Comput. Complex. TR04 (2004) - Alan L. Selman, Samik Sengupta:
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy. Electron. Colloquium Comput. Complex. TR04 (2004) - Vikraman Arvind, Jacobo Torán:
Solvable Group Isomorphism is (almost) in NP\cap coNP. Electron. Colloquium Comput. Complex. TR04 (2004) - Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs. Electron. Colloquium Comput. Complex. TR04 (2004) - Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Tolerant Property Testing and Distance Approximation. Electron. Colloquium Comput. Complex. TR04 (2004) - Christian Glaßer:
Counting with Counterfree Automata. Electron. Colloquium Comput. Complex. TR04 (2004) - Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore:
The Resolution Complexity of Random Graph k-Colorability. Electron. Colloquium Comput. Complex. TR04 (2004) - Oded Goldreich, Dana Ron:
On Estimating the Average Degree of a Graph. Electron. Colloquium Comput. Complex. TR04 (2004) - Chris Pollett:
Languages to diagonalize against advice classes. Electron. Colloquium Comput. Complex. TR04 (2004) - Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet:
Enumerations of the Kolmogorov Function. Electron. Colloquium Comput. Complex. TR04 (2004) - Michael Alekhnovich, Eli Ben-Sasson:
Linear Upper Bounds for Random Walk on Small Density Random 3CNFs. Electron. Colloquium Comput. Complex. TR04 (2004) - Evgeny Dantsin, Alexander Wolpert:
Derandomization of Schuler's Algorithm for SAT. Electron. Colloquium Comput. Complex. TR04 (2004) - Jan Krajícek:
Diagonalization in proof complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. Electron. Colloquium Comput. Complex. TR04 (2004) - Emanuele Viola:
The Complexity of Constructing Pseudorandom Generators from Hard Functions. Electron. Colloquium Comput. Complex. TR04 (2004) - Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding. Electron. Colloquium Comput. Complex. TR04 (2004) - Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
The Degree of Threshold Mod 6 and Diophantine Equations. Electron. Colloquium Comput. Complex. TR04 (2004) - Yaoyun Shi:
Quantum and Classical Tradeoffs. Electron. Colloquium Comput. Complex. TR04 (2004) - Thomas Thierauf, Thanh Minh Hoang:
On Closure Properties of GapL. Electron. Colloquium Comput. Complex. TR04 (2004) - John M. Hitchcock, Aduri Pavan, Pramodchandran N. Variyam:
Partial Bi-Immunity and NP-Completeness. Electron. Colloquium Comput. Complex. TR04 (2004) - Scott Aaronson:
Limitations of Quantum Advice and One-Way Communication. Electron. Colloquium Comput. Complex. TR04 (2004) - Henning Fernau:
Parametric Duality: Kernel Sizes and Algorithmics. Electron. Colloquium Comput. Complex. TR04 (2004) - Arfst Nickelsen, Till Tantau, Lorenz Weizsäcker:
Aggregates with Component Size One Characterize Polynomial Space. Electron. Colloquium Comput. Complex. TR04 (2004) - John M. Hitchcock, María López-Valdés, Elvira Mayordomo:
Scaled dimension and the Kolmogorov complexity of Turing hard sets. Electron. Colloquium Comput. Complex. TR04 (2004) - Nikolai K. Vereshchagin:
Kolmogorov complexity of enumerating finite sets. Electron. Colloquium Comput. Complex. TR04 (2004)
skipping 91 more matches
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-05-25 14:29 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