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 202 matches
- 2010
- Scott Aaronson:
A Counterexample to the Generalized Linial-Nisan Conjecture. Electron. Colloquium Comput. Complex. TR10 (2010) - Scott Aaronson:
The Equivalence of Sampling and Searching. Electron. Colloquium Comput. Complex. TR10 (2010) - Scott Aaronson, Alex Arkhipov:
The Computational Complexity of Linear Optics. Electron. Colloquium Comput. Complex. TR10 (2010) - Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek:
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Electron. Colloquium Comput. Complex. TR10 (2010) - Scott Aaronson, Andrew Drucker:
A Full Characterization of Quantum Advice. Electron. Colloquium Comput. Complex. TR10 (2010) - Scott Aaronson, Dieter van Melkebeek:
A note on circuit lower bounds from derandomization. Electron. Colloquium Comput. Complex. TR10 (2010) - Miklós Ajtai:
Oblivious RAMs without Cryptographic Assumptions. Electron. Colloquium Comput. Complex. TR10 (2010) - Eric Allender:
Avoiding Simplicity is Complex. Electron. Colloquium Comput. Complex. TR10 (2010) - Eric Allender, Vikraman Arvind, Fengming Wang:
Uniform Derandomization from Pathetic Lower Bounds. Electron. Colloquium Comput. Complex. TR10 (2010) - Eric Allender, Luke Friedman, William I. Gasarch:
Exposition of the Muchnik-Positselsky Construction of a Prefix Free Entropy Function that is not Complete under Truth-Table Reductions. Electron. Colloquium Comput. Complex. TR10 (2010) - Eric Allender, Luke Friedman, William I. Gasarch:
Limits on the Computational Power of Random Strings. Electron. Colloquium Comput. Complex. TR10 (2010) - Eric Allender, Klaus-Jörn Lange:
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Electron. Colloquium Comput. Complex. TR10 (2010) - Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland:
Symmetry-assisted adversaries for quantum state generation. Electron. Colloquium Comput. Complex. TR10 (2010) - Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich:
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. Electron. Colloquium Comput. Complex. TR10 (2010) - Sanjeev Arora, Rong Ge:
Learning Parities with Structured Noise. Electron. Colloquium Comput. Complex. TR10 (2010) - Sanjeev Arora, Russell Impagliazzo, William Matthews, David Steurer:
Improved Algorithms for Unique Games via Divide and Conquer. Electron. Colloquium Comput. Complex. TR10 (2010) - Albert Atserias, Elitza N. Maneva:
Mean-payoff games and propositional proofs. Electron. Colloquium Comput. Complex. TR10 (2010) - Ajesh Babu, Nutan Limaye, Girish Varma:
Streaming algorithms for some problems in log-space. Electron. Colloquium Comput. Complex. TR10 (2010) - Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff:
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Electron. Colloquium Comput. Complex. TR10 (2010) - Paul Beame, Widad Machmouchi:
Making RAMs Oblivious Requires Superlogarithmic Overhead. Electron. Colloquium Comput. Complex. TR10 (2010) - Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma:
Local list decoding with a constant number of queries. Electron. Colloquium Comput. Complex. TR10 (2010) - Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma:
A Note on Amplifying the Error-Tolerance of Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - Shir Ben-Israel, Eli Ben-Sasson, David R. Karger:
Breaking local symmetries can dramatically reduce the length of propositional refutations. Electron. Colloquium Comput. Complex. TR10 (2010) - Eli Ben-Sasson:
Limitation on the rate of families of locally testable codes. Electron. Colloquium Comput. Complex. TR10 (2010) - Eli Ben-Sasson, Jan Johannsen:
Lower bounds for width-restricted clause learning on small width formulas. Electron. Colloquium Comput. Complex. TR10 (2010) - Eli Ben-Sasson, Swastik Kopparty:
Affine Dispersers from Subspace Polynomials. Electron. Colloquium Comput. Complex. TR10 (2010) - Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
Symmetric LDPC codes are not necessarily locally testable. Electron. Colloquium Comput. Complex. TR10 (2010) - Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. Electron. Colloquium Comput. Complex. TR10 (2010) - Eli Ben-Sasson, Madhu Sudan:
Limits on the rate of locally testable affine-invariant codes. Electron. Colloquium Comput. Complex. TR10 (2010)
skipping 172 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-09-27 04:52 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