Остановите войну!
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 20 matches
- 2015
- Emmanuel Abbe, Andrea Montanari:
Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration. Theory Comput. 11: 413-443 (2015) - Per Austrin, Rajsekar Manokaran, Cenny Wenner:
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. Theory Comput. 11: 257-283 (2015) - Alexander I. Barvinok:
Computing the Partition Function for Cliques in a Graph. Theory Comput. 11: 339-355 (2015) - Aleksandrs Belovs, Eric Blais:
Quantum Algorithm for Monotonicity Testing on the Hypercube. Theory Comput. 11: 403-412 (2015) - Joshua Brody, Kasper Green Larsen:
Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures. Theory Comput. 11: 471-489 (2015) - Andrew M. Childs, David Gosset, Zak Webb:
The Bose-Hubbard Model is QMA-complete. Theory Comput. 11: 491-603 (2015) - John D. Faben, Mark Jerrum:
The Complexity of Parity Graph Homomorphism: An Initial Investigation. Theory Comput. 11: 35-57 (2015) - Shayan Oveis Gharan, Luca Trevisan:
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs. Theory Comput. 11: 241-256 (2015) - George Glauberman, Lukasz Grabowski:
Groups with Identical k-Profiles. Theory Comput. 11: 395-401 (2015) - Gus Gutoski, Patrick M. Hayden, Kevin Milner, Mark M. Wilde:
Quantum Interactive Proofs and the Complexity of Separability Testing. Theory Comput. 11: 59-103 (2015) - Elad Haramaty, Noga Ron-Zewi, Madhu Sudan:
Absolutely Sound Testing of Lifted Codes. Theory Comput. 11: 299-338 (2015) - Pavel Hrubes, Avi Wigderson:
Non-Commutative Arithmetic Circuits with Division. Theory Comput. 11: 357-393 (2015) - Jacek Jendrej, Krzysztof Oleszkiewicz, Jakub Onufry Wojtaszczyk:
On some extensions of the FKN theorem. Theory Comput. 11: 445-469 (2015) - David Kempe, Jon M. Kleinberg, Éva Tardos:
Maximizing the Spread of Influence through a Social Network. Theory Comput. 11: 105-147 (2015) - Swastik Kopparty:
List-Decoding Multiplicity Codes. Theory Comput. 11: 149-182 (2015) - Greg Kuperberg:
How Hard Is It to Approximate the Jones Polynomial? Theory Comput. 11: 183-219 (2015) - Joseph M. Landsberg, Giorgio Ottaviani:
New Lower Bounds for the Border Rank of Matrix Multiplication. Theory Comput. 11: 285-298 (2015) - Dana Moshkovitz:
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover. Theory Comput. 11: 221-235 (2015) - Sofya Raskhodnikova, Ola Svensson:
Special Issue: APPROX-RANDOM 2013: Guest Editors' Foreword. Theory Comput. 11: 237-239 (2015) - Thomas Watson:
The Complexity of Deciding Statistical Properties of Samplable Distributions. Theory Comput. 11: 1-34 (2015)
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-06-03 01:17 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