![](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
- 2011
- Boris Alexeev, Michael A. Forbes, Jacob Tsimerman:
Tensor Rank: Some Lower and Upper Bounds. CCC 2011: 283-291 - Andris Ambainis, Loïck Magnin, Martin Roetteler
, Jérémie Roland
:
Symmetry-Assisted Adversaries for Quantum State Generation. CCC 2011: 167-177 - Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich
:
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. CCC 2011: 273-282 - Paul Beame
, Widad Machmouchi:
Making Branching Programs Oblivious Requires Superlogarithmic Overhead. CCC 2011: 12-22 - Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka
, Madhu Sudan:
Symmetric LDPC Codes are not Necessarily Locally Testable. CCC 2011: 55-65 - Eli Ben-Sasson, Michael Viderman:
Towards Lower Bounds on Locally Testable Codes via Density Arguments. CCC 2011: 66-76 - Eric Blais, Joshua Brody, Kevin Matulef:
Property Testing Lower Bounds via Communication Complexity. CCC 2011: 210-220 - Harry Buhrman, Oded Regev, Giannicola Scarpa
, Ronald de Wolf:
Near-Optimal and Explicit Bell Inequality Violations. CCC 2011: 157-166 - Jin-yi Cai, Xi Chen
, Pinyan Lu
:
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy. CCC 2011: 45-54 - Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
:
Paris-Harrington Tautologies. CCC 2011: 93-103 - Arkadev Chattopadhyay, Shachar Lovett
:
Linear Systems over Finite Abelian Groups. CCC 2011: 300-308 - Anindya De:
Pseudorandomness for Permutation and Regular Branching Programs. CCC 2011: 221-231 - Andrew Drucker:
Improved Direct Product Theorems for Randomized Query Complexity. CCC 2011: 1-11 - Sevag Gharibian, Julia Kempe:
Approximation Algorithms for QMA-Complete Problems. CCC 2011: 178-188 - Venkatesan Guruswami:
Linear-Algebraic List Decoding of Folded Reed-Solomon Codes. CCC 2011: 77-85 - Russell Impagliazzo
:
Relativized Separations of Worst-Case and Average-Case Complexities for NP. CCC 2011: 104-114 - Daniel M. Kane:
k-Independent Gaussians Fool Polynomial Threshold Functions. CCC 2011: 252-261 - Zohar Shay Karnin, Yuval Rabani, Amir Shpilka
:
Explicit Dimension Reduction and Its Applications. CCC 2011: 262-272 - Neeraj Kayal, Chandan Saha:
On the Sum of Square Roots of Polynomials and Related Problems. CCC 2011: 292-299 - Hartmut Klauck
:
On Arthur Merlin Games in Communication Complexity. CCC 2011: 189-199 - Xin Li:
Improved Constructions of Three Source Extractors. CCC 2011: 126-136 - Xin Li:
A New Approach to Affine Extractors and Dispersers. CCC 2011: 137-147 - Shachar Lovett
, Emanuele Viola:
Bounded-Depth Circuits Cannot Sample Good Codes. CCC 2011: 243-251 - Ryan O'Donnell, Yi Wu, Yuan Zhou:
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. CCC 2011: 23-33 - Shubhangi Saraf, Sergey Yekhanin:
Noisy Interpolation of Sparse Polynomials, and Applications. CCC 2011: 86-92 - Amir Shpilka
, Avishay Tal:
On the Minimal Fourier Degree of Symmetric Boolean Functions. CCC 2011: 200-209 - Thomas Watson:
Pseudorandom Generators for Combinatorial Checkerboards. CCC 2011: 232-242 - Ryan Williams
:
Non-uniform ACC Circuit Lower Bounds. CCC 2011: 115-125 - Yuichi Yoshida:
Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs. CCC 2011: 34-44 - Marius Zimand:
Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors. CCC 2011: 148-156
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-07-29 07:42 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