default search action
Theory of Computing, Volume 18
Volume 18, 2022
- Andrew Drucker:
Guest Editor's Foreword to the RANDOM 2018 Special Issue. 1-3 - Xin Li, Shachar Lovett, Jiapeng Zhang:
Sunflowers and Robust Sunflowers from Randomness Extractors. 1-18 - Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan:
Near-Optimal NP-Hardness of Approximating Max k-CSPR. 1-29 - Rocco A. Servedio, Li-Yang Tan:
Improved Pseudorandom Generators from Pseudorandom Multi-switching Lemmas. 1-46 - Amey Bhangale, Subhash Khot:
UG-hardness to NP-hardness by Losing Half. 1-28 - Alon Eden, Uriel Feige, Michal Feldman:
Max-Min Greedy Matching. 1-33 - Kent Quanrud:
Fast and Deterministic Approximations for k-Cut. 1-24 - Lukas Fleischer:
The Cayley Semigroup Membership Problem. 1-18 - Zongchen Chen, Santosh S. Vempala:
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. 1-18 - Emanuele Viola:
Pseudorandom Bits and Lower Bounds for Randomized Turing Machines. 1-12 - Stacey Jeffery:
Span Programs and Quantum Space Complexity. 1-49 - Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi:
From Local to Robust Testing via Agreement Testing. 1-25 - Maya Leshkowitz:
Round Complexity Versus Randomness Complexity in Interactive Proofs. 1-65 - Zeev Dvir, Avishay Tal:
Guest Editors' Foreword to the CCC 2020 Special Issue. 1-4 - Alexander Kozachinskiy, Vladimir V. Podolskii:
Multiparty Karchmer-Wigderson Games and Threshold Circuits. 1-33 - Per Austrin, Petteri Kaski, Kaie Kubjas:
Tensor Network Complexity of Multilinear Maps. 1-54 - Xinyu Wu:
A Stochastic Calculus Approach to the Oracle Separation of BQP and PH. 1-11 - Chandra Chekuri, Tanmay Inamdar:
Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. 1-19 - Kaave Hosseini, Hamed Hatami, Shachar Lovett:
Sign-Rank vs. Discrepancy. 1-22 - Vladimir Braverman, Robert Krauthgamer, Lin F. Yang:
Universal Streaming of Subset Norms. 1-32 - Kuan Cheng, William M. Hoza:
Hitting Sets Give Two-Sided Derandomization of Small Space. 1-32 - Alexander Golovnev, Ishay Haviv:
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. 1-22 - Christian Coester, James R. Lee:
Pure Entropic Regularization for Metrical Task Systems. 1-24
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-11-21 20:18 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: