Остановите войну!
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 186 matches
- 2012
- Scott Aaronson, Paul F. Christiano:
Quantum Money from Hidden Subspaces. Electron. Colloquium Comput. Complex. TR12 (2012) - Scott Aaronson, Travis Hance:
Generalizing and Derandomizing Gurvits's Approximation Algorithm for the Permanent. Electron. Colloquium Comput. Complex. TR12 (2012) - Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn:
The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electron. Colloquium Comput. Complex. TR12 (2012) - Manindra Agrawal, Chandan Saha, Nitin Saxena:
Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas. Electron. Colloquium Comput. Complex. TR12 (2012) - Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Sylvester-Gallai type theorems for approximate collinearity. Electron. Colloquium Comput. Complex. TR12 (2012) - Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Gottfried Herold, Ludovic Perret:
Polly Cracker, Revisited. Electron. Colloquium Comput. Complex. TR12 (2012) - Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff:
Reductions to the set of random strings: the resource-bounded case. Electron. Colloquium Comput. Complex. TR12 (2012) - Eric Allender, Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou, Bangsheng Tang:
Time-space tradeoffs for width-parameterized SAT: Algorithms and lower bounds. Electron. Colloquium Comput. Complex. TR12 (2012) - Eric Allender, George Davie, Luke Friedman, Samuel Hopkins, Iddo Tzameret:
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. Electron. Colloquium Comput. Complex. TR12 (2012) - Noga Alon, Gil Cohen:
On Rigid Matrices and Subspace Polynomials. Electron. Colloquium Comput. Complex. TR12 (2012) - Noga Alon, Santosh S. Vempala:
The Approximate Rank of a Matrix and its Algorithmic Applications. Electron. Colloquium Comput. Complex. TR12 (2012) - Mikhail Anokhin:
Constructing a Pseudo-Free Family of Finite Computational Groups under the General Integer Factoring Intractability Assumption. Electron. Colloquium Comput. Complex. TR12 (2012) - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
How to Garble Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR12 (2012) - Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva:
Testing Permanent Oracles - Revisited. Electron. Colloquium Comput. Complex. TR12 (2012) - Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Factoring and Association Schemes. Electron. Colloquium Comput. Complex. TR12 (2012) - Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev:
Approximate Graph Isomorphism. Electron. Colloquium Comput. Complex. TR12 (2012) - Albert Atserias, Anuj Dawar:
Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. Electron. Colloquium Comput. Complex. TR12 (2012) - Albert Atserias, Sergi Oliva:
Bounded-width QBF is PSPACE-complete. Electron. Colloquium Comput. Complex. TR12 (2012) - Giorgio Ausiello, Francesco Cristiano, Luigi Laura:
Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. Electron. Colloquium Comput. Complex. TR12 (2012) - Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Limitations of Local Filters of Lipschitz and Monotone Functions. Electron. Colloquium Comput. Complex. TR12 (2012) - Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Testing Lipschitz Functions on Hypergrid Domains. Electron. Colloquium Comput. Complex. TR12 (2012) - Baris Aydinlioglu, Dieter van Melkebeek:
Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games. Electron. Colloquium Comput. Complex. TR12 (2012) - Boaz Barak:
Proof vs. Truth in Computational Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - Kfir Barhum, Thomas Holenstein:
A Cookbook for Black-Box Separations and a Recipe for UOWHFs. Electron. Colloquium Comput. Complex. TR12 (2012) - Paul Beame, Raphaël Clifford, Widad Machmouchi:
Sliding Windows With Limited Storage. Electron. Colloquium Comput. Complex. TR12 (2012) - Chris Beck, Russell Impagliazzo, Shachar Lovett:
Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-circuits. Electron. Colloquium Comput. Complex. TR12 (2012) - Xiaohui Bei, Ning Chen, Shengyu Zhang:
On the Complexity of Trial and Error. Electron. Colloquium Comput. Complex. TR12 (2012) - Avraham Ben-Aroya, Gil Cohen:
Gradual Small-Bias Sample Spaces. Electron. Colloquium Comput. Complex. TR12 (2012) - Avraham Ben-Aroya, Igor Shinkar:
A Note on Subspace Evasive Sets. Electron. Colloquium Comput. Complex. TR12 (2012) - Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs. Electron. Colloquium Comput. Complex. TR12 (2012)
skipping 156 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-04-25 12:48 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