default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 15
Volume 15, 2019
- Clément L. Canonne
, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity: The Rise and Fall of Boolean Functions. 1-55 - Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Time Bounds for Streaming Problems. 1-31 - Fulvio Gesmundo, Joseph M. Landsberg:
Explicit Polynomial Sequences with Maximal Spaces of Partial Derivatives and a Question of K. Mulmuley. 1-24 - Nikhil Bansal, Anupam Gupta:
Potential-Function Proofs for Gradient Methods. 1-32 - Zhengfeng Ji:
Classical Verification of Quantum Proofs. 1-42 - Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability is Computable and Approximately Low-Dimensional. 1-47 - Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. 1-36 - Zeev Dvir, Benjamin L. Edelman:
Matrix Rigidity and the Croot-Lev-Pach Lemma. 1-7 - Srikanth Srinivasan:
Special Issue: CCC 2018: Guest Editor's Foreword. 1-3 - Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett:
Pseudorandom Generators from Polarizing Random Walks. 1-26 - Swagato Sanyal:
Fourier Sparsity and Dimension. 1-13 - Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw Distributions and Locally Decodable Codes. 1-24 - Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure Results for Polynomial Factorization. 1-34 - Shiri Chechik, Ronen Shaltiel:
Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword. 1-3 - Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov:
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. 1-58 - Zeyu Guo, Nitin Saxena, Amit Sinhababu:
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field. 1-30 - Benjamin Rossman, Srikanth Srinivasan:
Separation of AC0[⊕] Formulas and Circuits. 1-20 - Emanuele Viola:
Lower Bounds for Data Structures with Space Close to Maximum Imply Circuit Lower Bounds. 1-9 - James B. Wilson:
The Threshold for Subgroup Profiles to Agree is Logarithmic. 1-25 - Timothy Gowers, Oliver Janzer:
Subsets of Cayley Graphs that Induce Many Edges. 1-29 - Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett:
The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. 1-27
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.
last updated on 2024-10-18 19:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
