Остановите войну!
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 34 matches
- 1990
- Eric Allender, Christopher B. Wilson:
Width-Bounded Reducibility and Binary Search over Complexity Classes. SCT 1990: 122-129 - Carme Àlvarez, Birgit Jenner:
A Very Hard Log Space Counting Class. SCT 1990: 154-168 - Amihood Amir, Richard Beigel, William I. Gasarch:
Some Connections Between Bounded Query Classes and Non-Uniform Complexity. SCT 1990: 232-243 - László Babai:
E-mail and the Unexpected Power of Interaction. SCT 1990: 30-44 - Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz:
Privacy, Additional Information, and Communication. SCT 1990: 55-65 - François Bédard, François Lemieux, Pierre McKenzie:
Extensions to Barrington's M-Program Model. SCT 1990: 200-209 - Ronald V. Book:
On Separating Complexity Classes. SCT 1990: 299-304 - Jin-yi Cai, Anne Condon, Richard J. Lipton:
On Bounded Round Multi-Prover Interactive Proof Systems. SCT 1990: 45-54 - Richard Chang, Jim Kadin:
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. SCT 1990: 169-178 - Peter Clote:
Bounded Arithmetic and Computational Complexity. SCT 1990: 186-199 - Joan Feigenbaum, Sampath Kannan, Noam Nisan:
Lower Bounds on Random-Self-Reducibility. SCT 1990: 100-109 - Lance Fortnow, John Rompel, Michael Sipser:
Errata for On the Power of Multi-Prover Interactive Protocols. SCT 1990: 318-319 - Frederic Green:
An Oracle Separating +P From PPph. SCT 1990: 295-298 - Thomas Gundermann, Nasser Ali Nasser, Gerd Wechsung:
A Survey on Counting Classes. SCT 1990: 140-153 - Péter Hajnal:
On the Power of Randomness in the Decision Tree Model. SCT 1990: 66-77 - Rafi Heiman, Ilan Newman, Avi Wigderson:
On Read-Once Threshold Formulae and Their Randomized Decision Tree Complexity. SCT 1990: 78-87 - Lane A. Hemachandra, Albrecht Hoene:
On Sets with Efficient Implicit Membership Tests. SCT 1990: 11-19 - Lane A. Hemachandra, Roy S. Rubinstein:
A Note on Relativizing Complexity Classes with Tally Oracles. SCT 1990: 287-294 - Steven Homer:
Structural Properties of Nondeterministic Complete Sets. SCT 1990: 3-10 - Johannes Köbler, Thomas Thierauf:
Complexity Classes with Advice. SCT 1990: 305-315 - Klaus-Jörn Lange:
Unambiguity of Circuits. SCT 1990: 130-137 - Gerhard Lischke:
Impossibilities and Possibilities of Weak Separation Between NP and Exponential Time. SCT 1990: 245-253 - Jack H. Lutz, William J. Schmidt:
Circuit Size Relative to Pseudorandom Oracles. SCT 1990: 268-286 - James F. Lynch:
The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity. SCT 1990: 210-222 - Yishay Mansour, Noam Nisan, Prasoon Tiwari:
The Computational Complexity of Universal Hashing. SCT 1990: 90 - Martin Mundhenk, Rainer Schuler:
Non-Uniform Complexity Classes and Random Languages. SCT 1990: 110-119 - Ilan Newman, Prabhakar Ragde, Avi Wigderson:
Perfect Hashing, Graph Entropy, and Circuit Complexity. SCT 1990: 91-99 - Noam Nisan:
On Read-Once vs. Multiple Access to Randomness in Logspace. SCT 1990: 179-184 - Mitsunori Ogiwara, Osamu Watanabe:
On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract). SCT 1990: 2 - Pekka Orponen:
On the Instance Complexity of NP-Hard Problems. SCT 1990: 20-27
skipping 4 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 00:27 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