default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd CCC 2018: San Diego, CA, USA
- Rocco A. Servedio:
33rd Computational Complexity Conference, CCC 2018, San Diego, CA, USA, June 22-24, 2018. LIPIcs 102, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-069-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xi
- Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini
, Shachar Lovett:
Pseudorandom Generators from Polarizing Random Walks. 1:1-1:21 - Daniel Kane, Sankeerth Rao:
A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n. 2:1-2:24 - Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A New Approach for Constructing Low-Error, Two-Source Extractors. 3:1-3:19 - Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs. 4:1-4:16 - Shuichi Hirahara, Igor C. Oliveira, Rahul Santhanam:
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits. 5:1-5:31 - Richard Ryan Williams:
Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials. 6:1-6:24 - Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
The Power of Natural Properties as Oracles. 7:1-7:20 - Sampath Kannan, Elchanan Mossel, Swagato Sanyal, Grigory Yaroslavtsev:
Linear Sketching over F_2. 8:1-8:37 - Thomas Watson:
Communication Complexity with Small Advantage. 9:1-9:17 - Zeyu Guo, Nitin Saxena, Amit Sinhababu:
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity. 10:1-10:21 - Noga Alon, Mrinal Kumar, Ben Lee Volk:
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. 11:1-11:16 - Marco L. Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin:
Hardness Amplification for Non-Commutative Arithmetic Circuits. 12:1-12:16 - Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Hardness vs Randomness for Bounded Depth Arithmetic Circuits. 13:1-13:17 - Lijie Chen:
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. 14:1-14:45 - Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi:
Hardness of Function Composition for Semantic Read once Branching Programs. 15:1-15:22 - Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Reordering Rule Makes OBDD Proof Systems Stronger. 16:1-16:24 - Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Testing Linearity against Non-Signaling Strategies. 17:1-17:37 - Omri Ben-Eliezer, Eldar Fischer:
Earthmover Resilience and Testing in Ordered Structures. 18:1-18:35 - Daniel Grier, Luke Schaeffer:
New Hardness Results for the Permanent Using Linear Optics. 19:1-19:29 - Anand Natarajan, Thomas Vidick:
Two-Player Entangled Games are NP-Hard. 20:1-20:18 - Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh:
Complexity Classification of Conjugated Clifford Circuits. 21:1-21:25 - Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Efficient Batch Verification for UP. 22:1-22:23 - Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang:
A Tight Lower Bound for Entropy Flattening. 23:1-23:28 - Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf:
Worst-Case to Average Case Reductions for the Distance to a Code. 24:1-24:23 - Lukas Fleischer:
On the Complexity of the Cayley Semigroup Membership Problem. 25:1-25:12 - Andrzej Lingas:
Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth. 26:1-26:10 - Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers. 27:1-27:16 - Badih Ghazi, Pritish Kamath, Prasad Raghavendra:
Dimension Reduction for Polynomials over Gaussian Space and Applications. 28:1-28:37
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 2025-11-22 00:29 CET 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:
