![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 32 matches
- 2014
- Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby
, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. CCC 2014: 56-65 - Scott Aaronson, Russell Impagliazzo
, Dana Moshkovitz:
AM with Multiple Merlins. CCC 2014: 44-55 - Andris Ambainis:
On Physical Problems that are Slightly More Difficult than QMA. CCC 2014: 32-43 - Albert Atserias, Massimo Lauria
, Jakob Nordström
:
Narrow Proofs May Be Maximally Long. CCC 2014: 286-297 - Arturs Backurs, Mohammad Bavarian:
On the Sum of L1 Influences. CCC 2014: 132-143 - Bruno Bauwens
, Marius Zimand
:
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits). CCC 2014: 241-247 - Aleksandrs Belovs:
Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound. CCC 2014: 22-31 - Eric Blais, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Lower Bounds for Testing Properties of Functions over Hypergrid Domains. CCC 2014: 309-320 - Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-algorithms. CCC 2014: 262-273 - Daniel Dadush
, Oded Regev, Noah Stephens-Davidowitz:
On the Closest Vector Problem with a Distance Guarantee. CCC 2014: 98-109 - Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. CCC 2014: 229-240 - Irit Dinur
, David Steurer:
Direct Product Testing. CCC 2014: 188-196 - Irit Dinur
, David Steurer, Thomas Vidick
:
A Parallel Repetition Theorem for Entangled Projection Games. CCC 2014: 197-208 - Craig Gentry:
Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington's Theorem. CCC 2014: 181-187 - Joshua A. Grochow:
Unifying Known Lower Bounds via Geometric Complexity Theory. CCC 2014: 274-285 - Joshua A. Grochow, Youming Qiao
:
Algorithms for Group Isomorphism via Group Extensions and Cohomology. CCC 2014: 110-119 - Venkatesan Guruswami, Chaoping Xing:
Hitting Sets for Low-Degree Polynomials with Optimal Density. CCC 2014: 161-168 - Russell Impagliazzo
, Valentine Kabanets:
Fourier Concentration from Shrinkage. CCC 2014: 321-332 - Rahul Jain
, Attila Pereszlényi, Penghui Yao:
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. CCC 2014: 209-216 - Daniel M. Kane:
A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length. CCC 2014: 217-228 - Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. CCC 2014: 169-180 - James R. Lee, Prasad Raghavendra, David Steurer, Ning Tan:
On the Power of Symmetric LP and SDP Relaxations. CCC 2014: 13-21 - Daniele Micciancio
:
Locally Dense Codes. CCC 2014: 90-97 - Ryan O'Donnell, David Witmer:
Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch. CCC 2014: 1-12 - Ryan O'Donnell, John Wright, Yu Zhao, Xiaorui Sun, Li-Yang Tan:
A Composition Theorem for Parity Kill Number. CCC 2014: 144-154 - Periklis A. Papakonstantinou, Dominik Scheder
, Hao Song:
Overlays and Limited Memory Communication. CCC 2014: 298-308 - Rishi Saket:
Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. CCC 2014: 78-89 - Shubhangi Saraf:
Recent Progress on Lower Bounds for Arithmetic Circuits. CCC 2014: 155-160 - Simon Straub, Thomas Thierauf, Fabian Wagner:
Counting the Number of Perfect Matchings in K5-Free Graphs. CCC 2014: 66-77 - Ryan Williams
:
Algorithms for Circuits and Circuits for Algorithms. CCC 2014: 248-261
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-01 00:26 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