Остановите войну!
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 35 matches
- 2017
- Scott Aaronson, Lijie Chen:
Complexity-Theoretic Foundations of Quantum Supremacy Experiments. CCC 2017: 22:1-22:67 - Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating Quantum Communication and Approximate Rank. CCC 2017: 24:1-24:33 - Srinivasan Arunachalam, Ronald de Wolf:
Optimal Quantum Sample Complexity of Learning Algorithms. CCC 2017: 25:1-25:31 - Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang:
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CCC 2017: 30:1-30:24 - Eric Blais, Clément L. Canonne, Tom Gur:
Distribution Testing Lower Bounds via Reductions from Communication Complexity. CCC 2017: 28:1-28:40 - Markus Bläser, Gorav Jindal, Anurag Pandey:
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. CCC 2017: 33:1-33:16 - Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On Algebraic Branching Programs of Small Width. CCC 2017: 20:1-20:31 - Clément L. Canonne, Tom Gur:
An Adaptivity Hierarchy Theorem for Property Testing. CCC 2017: 27:1-27:25 - Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the Query Complexity of Non-Adaptive Junta Testing. CCC 2017: 26:1-26:19 - Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading Information Complexity for Error. CCC 2017: 16:1-16:59 - Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability Is Computable and Approximately Low-Dimensional. CCC 2017: 10:1-10:11 - Irit Dinur, Inbal Livni Navon:
Exponentially Small Soundness for the Direct Product Z-Test. CCC 2017: 29:1-29:50 - Mrinalkanti Ghosh, Madhur Tulsiani:
From Weak to Strong LP Gaps for All CSPs. CCC 2017: 11:1-11:27 - Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for PNP. CCC 2017: 12:1-12:16 - Elad Haramaty, Chin Ho Lee, Emanuele Viola:
Bounded Independence Plus Noise Fools Products. CCC 2017: 14:1-14:30 - Shuichi Hirahara, Rahul Santhanam:
On the Average-Case Complexity of MCSP and Its Variants. CCC 2017: 7:1-7:20 - Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of Full Rank Algebraic Branching Programs. CCC 2017: 21:1-21:61 - Mrinal Kumar:
A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs. CCC 2017: 19:1-19:16 - Mrinal Kumar, Ramprasad Saptharishi:
An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields. CCC 2017: 31:1-31:30 - Massimo Lauria, Jakob Nordström:
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. CCC 2017: 2:1-2:20 - Dieter van Melkebeek, Gautam Prakriya:
Derandomizing Isolation in Space-Bounded Settings. CCC 2017: 5:1-5:32 - Alexey Milovanov, Nikolay K. Vereshchagin:
Stochasticity in Algorithmic Statistics for Polynomial Time. CCC 2017: 17:1-17:18 - Daniel Minahan, Ilya Volkovich:
Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas. CCC 2017: 32:1-32:13 - Cody D. Murray, R. Ryan Williams:
Easiness Amplification and Uniform Circuit Lower Bounds. CCC 2017: 8:1-8:21 - Ashwin Nayak, Dave Touchette:
Augmented Index and Quantum Streaming Algorithms for DYCK(2). CCC 2017: 23:1-23:21 - Danny Nguyen, Igor Pak:
The Computational Complexity of Integer Programming with Alternations. CCC 2017: 6:1-6:18 - Mateus de Oliveira Oliveira, Pavel Pudlák:
Representations of Monotone Boolean Functions by Linear Programs. CCC 2017: 3:1-3:14 - Igor C. Oliveira, Rahul Santhanam:
Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness. CCC 2017: 18:1-18:49 - Aaron Potechin:
A Note on Amortized Branching Program Complexity. CCC 2017: 4:1-4:12 - Pavel Pudlák, Neil Thapen:
Random Resolution Refutations. CCC 2017: 1:1-1:10
skipping 5 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-06-11 09:54 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