![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 31 matches
- 2004
- Scott Aaronson:
Limitations of Quantum Advice and One-Way Communication. CCC 2004: 320-332 - Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig:
Multiparty Quantum Coin Flipping. CCC 2004: 250-259 - Andris Ambainis, Ke Yang:
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. CCC 2004: 305-319 - Vikraman Arvind, Jacobo Torán:
Solvable Group Isomorphism. CCC 2004: 91-103 - Vikraman Arvind, T. C. Vijayaraghavan:
Abelian Permutation Group Problems and Logspace Counting Classes. CCC 2004: 204-214 - Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
Polynomials That Sign Represent Parity and Descartes Rule of Signs. CCC 2004: 223-235 - Andrej Bogdanov, Luca Trevisan:
Lower Bounds for Testing Bipartiteness in Dense Graphs. CCC 2004: 75-81 - Harry Buhrman, Troy Lee, Dieter van Melkebeek:
Language Compression and Pseudorandom Generators. CCC 2004: 15-28 - Harry Buhrman, Leen Torenvliet:
Separating Complexity Classes Using Structural Properties. CCC 2004: 130-138 - Josh Buresh-Oppenheim, Tsuyoshi Morioka:
Relativized NP Search Problems and Propositional Proof Systems. CCC 2004: 54-67 - Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia:
Tight Lower Bounds for Certain Parameterized NP-Hard Problems. CCC 2004: 150-160 - Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous:
Consequences and Limits of Nonlocal Strategies. CCC 2004: 236-249 - Nicola Galesi, Neil Thapen:
The Complexity of Treelike Systems over lamda-Local Formulae. CCC 2004: 68-74 - Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. CCC 2004: 184-197 - Christian Glaßer, Alan L. Selman, Samik Sengupta:
Reductions between Disjoint NP-Pairs. CCC 2004: 42-53 - Venkatesan Guruswami, Daniele Micciancio
, Oded Regev:
The Complexity of the Covering Radius Problem on Lattices and Codes. CCC 2004: 161-173 - John M. Hitchcock:
Small Spans in Scaled Dimension. CCC 2004: 104-112 - John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Partial Bi-immunity and NP-Completeness. CCC 2004: 198-203 - John M. Hitchcock, N. V. Vinodchandran:
Dimension, Entropy Rates, and Compression. CCC 2004: 174-183 - Klaus-Jörn Lange:
Some Results on Majority Quantifiers over Words. CCC 2004: 123-129 - Sophie Laplante, Frédéric Magniez:
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. CCC 2004: 294-304 - Chris Marriott, John Watrous:
Quantum Arthur-Merlin Games. CCC 2004: 275-285 - Dániel Marx:
Parameterized Complexity of Constraint Satisfaction Problems. CCC 2004: 139-149 - Ilan Newman:
Computing in Fault Tolerance Broadcast Networks. CCC 2004: 113-122 - Ran Raz
, Amir Shpilka
:
Deterministic Polynomial Identity Testing in Non-Commutative Models. CCC 2004: 215-222 - Ran Raz
, Amir Shpilka
:
On the Power of Quantum Proofs. CCC 2004: 260-274 - Alan L. Selman, Samik Sengupta:
Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. CCC 2004: 82-90 - Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang:
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? CCC 2004: 286-293 - Luca Trevisan, Salil P. Vadhan, David Zuckerman:
Compression of Samplable Sources. CCC 2004: 1-14 - Hoeteck Wee:
On Pseudoentropy versus Compressibility. CCC 2004: 29-41
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-24 05: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