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 18 matches
- 2020
- Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 106: Teaching Models, Computability, and Complexity in Time of COVID-19. SIGACT News 51(3): 55-58 (2020) - 2017
- Andrew Lewis-Pye, Wolfgang Merkle:
Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015). Theory Comput. Syst. 61(4): 1252-1253 (2017) - Johanna N. Y. Franklin:
Strength and Weakness in Computable Structure Theory. Computability and Complexity 2017: 302-323 - Carl G. Jockusch Jr., Paul E. Schupp:
Asymptotic Density and the Theory of Computability: A Partial Survey. Computability and Complexity 2017: 501-520 - Andrey S. Morozov:
Computable Model Theory over the Reals. Computability and Complexity 2017: 354-365 - Alexandra A. Soskova, Mariya Ivanova Soskova:
Enumeration Reducibility and Computable Structure Theory. Computability and Complexity 2017: 271-301 - 2016
- Noam Greenberg:
Editorial: Special Issue on Computability, Complexity and Randomness. Theory Comput. Syst. 58(3): 381-382 (2016) - 2014
- Egor Ianovski, Russell G. Miller, Keng Meng Ng, André Nies:
Complexity of Equivalence Relations and Preorders from Computability Theory. J. Symb. Log. 79(3): 859-881 (2014) - 2013
- Rod Downey:
Computability, Complexity and Randomness. Theory Comput. Syst. 52(1): 1 (2013) - Jeffrey O. Shallit:
Review of computability and complexity theory by Steven Homer and Alan L. Selman. SIGACT News 44(4): 41-42 (2013) - 2011
- Steven Homer, Alan L. Selman:
Computability and Complexity Theory, Second Edition. Texts in Computer Science, Springer 2011, ISBN 978-1-4614-0681-5, pp. I-XVI, 1-298 - James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers:
Computability and Complexity in Self-assembly. Theory Comput. Syst. 48(3): 617-647 (2011) - 2010
- Rodney G. Downey, Denis R. Hirschfeldt:
Algorithmic Randomness and Complexity. Theory and Applications of Computability, Springer 2010, ISBN 978-0-387-95567-4, pp. 1-766 - 2009
- Martin Ziegler:
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability. CCA 2009 - 2008
- Martin Ziegler:
Real Computation with Few Discrete Advice: A Complexity Theory of Nonuniform Computability. CoRR abs/0811.3782 (2008) - 2004
- Gunther Mainhardt:
P versus NP and computability theoretic constructions in complexity theory over algebraic structures. J. Symb. Log. 69(1): 39-64 (2004) - 2002
- E. W. Cenek:
Computability and complexity theory and the complexity theory companion. SIGACT News 33(3): 17-19 (2002) - 2001
- Steven Homer, Alan L. Selman:
Computability and Complexity Theory. Texts in Computer Science, Springer 2001, ISBN 978-1-4419-2865-8, pp. i-xiii, 1-195
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-09-29 10:56 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