Остановите войну!
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 29 matches
- 2010
- Eric Allender, Klaus-Jörn Lange:
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. CCC 2010: 172-180 - Eric Blais, Ryan O'Donnell:
Lower Bounds for Testing Function Isomorphism. CCC 2010: 235-246 - Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff:
Derandomizing from Random Strings. CCC 2010: 58-63 - Matei David, Periklis A. Papakonstantinou:
Trade-Off Lower Bounds for Stack Machines. CCC 2010: 163-171 - Matt DeVos, Ariel Gabizon:
Simple Affine Extractors Using Dimension Expansion. CCC 2010: 50-57 - Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan:
A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions. CCC 2010: 211-222 - Irit Dinur, Or Meir:
Derandomized Parallel Repetition of Structured PCPs. CCC 2010: 16-27 - Zeev Dvir:
On Matrix Rigidity and Locally Self-Correctable Codes. CCC 2010: 291-298 - Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman:
Fooling Functions of Halfspaces under Product Distributions. CCC 2010: 223-234 - Dan Gutfreund, Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. CCC 2010: 38-49 - Iftach Haitner, Mohammad Mahmoody, David Xiao:
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. CCC 2010: 76-87 - Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii:
Exact Threshold Circuits. CCC 2010: 270-279 - Thanh Minh Hoang:
On the Matching Problem for Special Graph Classes. CCC 2010: 139-150 - Pavel Hrubes, Avi Wigderson, Amir Yehudayoff:
Relationless Completeness and Separations. CCC 2010: 280-290 - Russell Impagliazzo, Ryan Williams:
Communication Complexity with Synchronized Clocks. CCC 2010: 259-269 - Rahul Jain, Hartmut Klauck:
The Partition Bound for Classical Communication Complexity and Query Complexity. CCC 2010: 247-258 - Daniel M. Kane:
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions. CCC 2010: 205-210 - Julia Kempe, Oded Regev:
No Strong Parallel Repetition with Entangled and Non-signaling Provers. CCC 2010: 7-15 - Subhash Khot:
On the Unique Games Conjecture (Invited Survey). CCC 2010: 99-121 - Alexandra Kolla:
Spectral Algorithms for Unique Games. CCC 2010: 122-130 - Mohammad Mahmoody, David Xiao:
On the Power of Randomized Reductions and the Checkability of SAT. CCC 2010: 64-75 - Dániel Marx:
Completely Inapproximable Monotone and Antimonotone Parameterized Problems. CCC 2010: 181-187 - Jakob Nordström:
On the Relative Strength of Pebbling and Resolution. CCC 2010: 151-162 - Ran Raz:
Parallel Repetition of Two Prover Games (Invited Survey). CCC 2010: 3-6 - Oded Regev:
The Learning with Errors Problem (Invited Survey). CCC 2010: 191-204 - Ronen Shaltiel:
Derandomized Parallel Repetition Theorems for Free Games. CCC 2010: 28-37 - Derrick Stolee, Chris Bourke, N. V. Vinodchandran:
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. CCC 2010: 131-138 - Luca Trevisan:
The Program-Enumeration Bottleneck in Average-Case Complexity Theory. CCC 2010: 88-95 - Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010. IEEE Computer Society 2010, ISBN 978-0-7695-4060-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-08-05 19:24 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