Остановите войну!
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 28 matches
- 1998
- Manindra Agrawal, Thomas Thierauf:
The Satisfiability Problem for Probabilistic Ordered Branching Programs. CCC 1998: 81- - Eric Allender, Klaus Reinhardt:
Isolation, Matching, and Counting. CCC 1998: 92-100 - Richard Beigel, Bin Fu:
Solving Intractable Problems with DNA Computing. CCC 1998: 154- - Amos Beimel, Anna Gál:
On Arithmetic Branching Programs. CCC 1998: 68-80 - Harry Buhrman, Lance Fortnow:
Two Queries. CCC 1998: 13- - Harry Buhrman, Lance Fortnow, Thomas Thierauf:
Nonrelativizing Separations. CCC 1998: 8-12 - Harry Buhrman, Dieter van Melkebeek:
Hard Sets are Hard to Find. CCC 1998: 170-181 - Harry Buhrman, Leen Torenvliet:
Randomness is Hard. CCC 1998: 249-260 - Jin-yi Cai, Ajay Nerurkar:
Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions. CCC 1998: 46- - Giovanni Di Crescenzo, Russell Impagliazzo:
Proofs of Membership vs. Proofs of Knowledge. CCC 1998: 34-45 - Rodney G. Downey, Lance Fortnow:
Uniformly Hard Languages. CCC 1998: 228- - Lance Fortnow, John D. Rogers:
Complexity Limitations on Quantum Computation. CCC 1998: 202-209 - Oded Goldreich, Madhu Sudan:
Computational Indistinguishability: A Sample Hierarchy. CCC 1998: 24-33 - Judy Goldsmith, Martin Mundhenk:
Complexity Issues in Markov Decision Processes. CCC 1998: 272-280 - Birgit Jenner, Pierre McKenzie, Jacobo Torán:
A Note on the Hardness of Tree Isomorphism. CCC 1998: 101-105 - Hartmut Klauck:
Lower Bounds for Computation with Limited Nondeterminism. CCC 1998: 141- - Johannes Köbler, Wolfgang Lindner:
On the Resource Bounded Measure of P/poly. CCC 1998: 182-185 - Johannes Köbler, Jochen Messner:
Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. CCC 1998: 132-140 - Wolfgang Lindner, Rainer Schuler, Osamu Watanabe:
Resource Bounded Measure and Learnability. CCC 1998: 261- - Jack H. Lutz:
Resource-Bounded Measure. CCC 1998: 236-248 - Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Theory of Periodically Specified Problems: Complexity and Approximability. CCC 1998: 106- - Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin:
Arthur-Merlin Games in Boolean Decision Trees. CCC 1998: 58-67 - Kenneth W. Regan, D. Sivakumar:
Probabilistic Martingales and BPTIME Classes. CCC 1998: 186- - D. Sivakumar:
On Membership Comparable Sets. CCC 1998: 2-7 - Daniel A. Spielman:
Models of Computation in Coding Theory. CCC 1998: 120- - Helmut Veith:
How to Encode a Logical Structure by an OBDD. CCC 1998: 122-131 - John Watrous:
Relationships Between Quantum and Classical Space-Bounded Complexity Classes. CCC 1998: 210-227 - Proceedings of the 13th Annual IEEE Conference on Computational Complexity, Buffalo, New York, USA, June 15-18, 1998. IEEE Computer Society 1998, ISBN 0-8186-8395-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-05-04 11:58 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