![](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 34 matches
- 2019
- Josh Alman:
Limits on the Universal Method for Matrix Multiplication. CCC 2019: 12:1-12:24 - Albert Atserias
, Tuomas Hakoniemi
:
Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs. CCC 2019: 24:1-24:20 - Mitali Bafna, Nikhil Vyas:
Imperfect Gaps in Gap-ETH and PCPs. CCC 2019: 32:1-32:19 - Amey Bhangale, Subhash Khot:
UG-Hardness to NP-Hardness by Losing Half. CCC 2019: 3:1-3:20 - Eric Blais, Joshua Brody:
Optimal Separation and Strong Direct Sum for Randomized Query Complexity. CCC 2019: 29:1-29:17 - Mark Braverman, Klim Efremenko
, Ran Gelles
, Michael A. Yitayew:
Optimal Short-Circuit Resilient Formulas. CCC 2019: 10:1-10:22 - Karl Bringmann, Nick Fischer, Marvin Künnemann:
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Existsk-Forall-Quantified First-Order Graph Properties. CCC 2019: 31:1-31:27 - Nader H. Bshouty:
Almost Optimal Distribution-Free Junta Testing. CCC 2019: 2:1-2:13 - Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
:
Simple and Efficient Pseudorandom Generators from Gaussian Processes. CCC 2019: 4:1-4:33 - Arkadev Chattopadhyay, Shachar Lovett, Marc Vinyals
:
Equality Alone Does not Simulate Randomness. CCC 2019: 14:1-14:11 - Lijie Chen, Dylan M. McKay, Cody D. Murray, R. Ryan Williams
:
Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. CCC 2019: 30:1-30:21 - Lijie Chen, R. Ryan Williams
:
Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. CCC 2019: 19:1-19:43 - Matthias Christandl
, Péter Vrana, Jeroen Zuiddam
:
Barriers for Fast Matrix Multiplication from Irreversibility. CCC 2019: 26:1-26:17 - Matthew Coudron
, Aram W. Harrow
:
Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion. CCC 2019: 20:1-20:25 - Matthew Coudron
, William Slofstra:
Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision. CCC 2019: 25:1-25:20 - Stefan S. Dantchev
, Nicola Galesi, Barnaby Martin
:
Resolution and the Binary Encoding of Combinatorial Principles. CCC 2019: 6:1-6:25 - Dean Doron
, Pooya Hatami
, William M. Hoza
:
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. CCC 2019: 16:1-16:34 - Zeev Dvir, Allen Liu:
Fourier and Circulant Matrices Are Not Rigid. CCC 2019: 17:1-17:23 - Ashish Dwivedi, Rajat Mittal, Nitin Saxena
:
Counting Basic-Irreducible Factors Mod pk in Deterministic Poly-Time and p-Adic Applications. CCC 2019: 15:1-15:29 - François Le Gall:
Average-Case Quantum Advantage with Shallow Circuits. CCC 2019: 21:1-21:20 - Sumegha Garg, Ran Raz
, Avishay Tal:
Time-Space Lower Bounds for Two-Pass Learning. CCC 2019: 22:1-22:39 - Kaave Hosseini
, Shachar Lovett, Grigory Yaroslavtsev:
Optimality of Linear Sketching Under Modular Updates. CCC 2019: 13:1-13:17 - William M. Hoza
:
Typically-Correct Derandomization for Small Time and Space. CCC 2019: 9:1-9:39 - Chin Ho Lee:
Fourier Bounds and Pseudorandom Generators for Product Tests. CCC 2019: 7:1-7:25 - Xin Li:
Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions. CCC 2019: 28:1-28:49 - Shachar Lovett, Noam Solomon, Jiapeng Zhang:
From DNF Compression to Sunflower Theorems via Regularity. CCC 2019: 5:1-5:14 - Ryan O'Donnell, Tselil Schramm
:
Sherali - Adams Strikes Back. CCC 2019: 8:1-8:30 - Igor Carboni Oliveira, Ján Pich
, Rahul Santhanam:
Hardness Magnification near State-Of-The-Art Lower Bounds. CCC 2019: 27:1-27:29 - Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan
:
Parity Helps to Compute Majority. CCC 2019: 23:1-23:17 - Susanna F. de Rezende
, Jakob Nordström
, Or Meir, Robert Robere:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CCC 2019: 18:1-18:16
skipping 4 more matches
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-08-19 20: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