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 29 matches
- 1986
- Eric Allender:
The Complexity of Sparse Sets in P. SCT 1986: 1-11 - Eric Allender:
Isomorphisms and 1-L Reductions. SCT 1986: 12-22 - Klaus Ambos-Spies:
Randomness, Relativizations, and Polynomial Reducibilities. SCT 1986: 23-34 - José L. Balcázar, Josep Díaz, Joaquim Gabarró:
On Non- uniform Polynomial Space. SCT 1986: 35-50 - Ravi B. Boppana, J. C. Lagarias:
One- Way Functions and Circuit Complexity. SCT 1986: 51-65 - Jonathan F. Buss:
Relativized Alternation. SCT 1986: 66-76 - Samuel R. Buss:
The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic. SCT 1986: 77-103 - Jin-yi Cai:
With Probability One, A Random Oracle Separates PSPACE from the Polynomial- Time Hierarchy. SCT 1986: 104-104 - Jin-yi Cai, Lane A. Hemachandra:
The Boolean Hierarchy: Hardware over NP. SCT 1986: 105-124 - Peter Clote, Gaisi Takeuti:
Exponential Time and Bounded Arithmetic. SCT 1986: 125-143 - Anne Condon, Richard E. Ladner:
Probabilistic Game Automata. SCT 1986: 144-162 - Martin Dietzfelbinger, Wolfgang Maass:
two Lower Bound Arguments with "Inaccessible" Numbers. SCT 1986: 163-183 - Dung T. Huynh:
Resource- Bounded Kolmogorov Complexity of Hard Languages. SCT 1986: 184-195 - Ker-I Ko, Timothy J. Long, Ding-Zhu Du:
A Note on One- Way Functions and Polynomial Time Isomorphisms. SCT 1986: 196-196 - Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe:
What Is a Hard Instance of a Computational Problem?. SCT 1986: 197-217 - Mark W. Krentel:
The Complexity of Optimization Problems. SCT 1986: 217-217 - Ming Li, Luc Longpré, Paul M. B. Vitányi:
The Power of the Queue. SCT 1986: 218-233 - James F. Lynch:
A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In. SCT 1986: 234-248 - Wolfgang Maass, Georg Schnitger:
An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape. SCT 1986: 249-264 - Ken McAloon:
Separation Results for Bounded Alternation. SCT 1986: 265-271 - Ian Parberry, Georg Schnitger:
Parallel Computation with Threshold Functions. SCT 1986: 272-290 - Kenneth W. Regan:
The Topology of Provability in Complexity Theory. SCT 1986: 291-310 - David A. Russo:
Optimal Approximations of Complete Sets. SCT 1986: 311-324 - Michael Sipser:
Expanders, Randomness, or Time versus Space. SCT 1986: 325-329 - Leen Torenvliet, Peter van Emde Boas:
Diagonalisation methods in a polynomial setting. SCT 1986: 330-346 - Carol Tretkoff:
Bounded Oracles and Complexity Classes Inside Linear Space. SCT 1986: 347-361 - Christopher B. Wilson:
Parallel Computation and the NC Hierarchy Relativized. SCT 1986: 362-382 - Stathis Zachos:
Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview. SCT 1986: 383-400 - Alan L. Selman:
Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, USA, June 2-5, 1986. Lecture Notes in Computer Science 223, Springer 1986, ISBN 3-540-16486-3 [contents]
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-27 11:23 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