Login / Signup
Theory Comput.
2005
2011
2015
2022
2005
2022
Keyphrases
Publications
volume 18, 2022
Kuan Cheng
,
William M. Hoza
Hitting Sets Give Two-Sided Derandomization of Small Space.
Theory Comput.
18 (2022)
Zongchen Chen
,
Santosh S. Vempala
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions.
Theory Comput.
18 (2022)
Zeev Dvir
,
Avishay Tal
Guest Editors' Foreword to the CCC 2020 Special Issue.
Theory Comput.
18 (2022)
Pasin Manurangsi
,
Preetum Nakkiran
,
Luca Trevisan
.
Theory Comput.
18 (2022)
Amey Bhangale
,
Subhash Khot
UG-hardness to NP-hardness by Losing Half.
Theory Comput.
18 (2022)
Xin Li
,
Shachar Lovett
,
Jiapeng Zhang
Sunflowers and Robust Sunflowers from Randomness Extractors.
Theory Comput.
18 (2022)
Chandra Chekuri
,
Tanmay Inamdar
Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks.
Theory Comput.
18 (2022)
Xinyu Wu
A Stochastic Calculus Approach to the Oracle Separation of BQP and PH.
Theory Comput.
18 (2022)
Kent Quanrud
Fast and Deterministic Approximations for k-Cut.
Theory Comput.
18 (2022)
Vladimir Braverman
,
Robert Krauthgamer
,
Lin F. Yang
Universal Streaming of Subset Norms.
Theory Comput.
18 (2022)
Alexander Golovnev
,
Ishay Haviv
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications.
Theory Comput.
18 (2022)
Irit Dinur
,
Prahladh Harsha
,
Tali Kaufman
,
Noga Ron-Zewi
From Local to Robust Testing via Agreement Testing.
Theory Comput.
18 (2022)
Emanuele Viola
Pseudorandom Bits and Lower Bounds for Randomized Turing Machines.
Theory Comput.
18 (2022)
Alon Eden
,
Uriel Feige
,
Michal Feldman
Max-Min Greedy Matching.
Theory Comput.
18 (2022)
Lukas Fleischer
The Cayley Semigroup Membership Problem.
Theory Comput.
18 (2022)
Per Austrin
,
Petteri Kaski
,
Kaie Kubjas
Tensor Network Complexity of Multilinear Maps.
Theory Comput.
18 (2022)
Maya Leshkowitz
Round Complexity Versus Randomness Complexity in Interactive Proofs.
Theory Comput.
18 (2022)
Christian Coester
,
James R. Lee
Pure Entropic Regularization for Metrical Task Systems.
Theory Comput.
18 (2022)
Kaave Hosseini
,
Hamed Hatami
,
Shachar Lovett
Sign-Rank vs. Discrepancy.
Theory Comput.
18 (2022)
Andrew Drucker
Guest Editor's Foreword to the RANDOM 2018 Special Issue.
Theory Comput.
18 (2022)
Alexander Kozachinskiy
,
Vladimir V. Podolskii
Multiparty Karchmer-Wigderson Games and Threshold Circuits.
Theory Comput.
18 (2022)
Rocco A. Servedio
,
Li-Yang Tan
Improved Pseudorandom Generators from Pseudorandom Multi-switching Lemmas.
Theory Comput.
18 (2022)
Stacey Jeffery
Span Programs and Quantum Space Complexity.
Theory Comput.
18 (2022)
volume 17, 2021
Julia Chuzhoy
,
David Hong Kyun Kim
,
Rachit Nimavat
Almost Polynomial Hardness of Node-Disjoint Paths in Grids.
Theory Comput.
17 (2021)
Amir Abboud
,
Robert Krauthgamer
,
Ohad Trabelsi
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs.
Theory Comput.
17 (2021)
Ryan O'Donnell
,
Tselil Schramm
Sherali-Adams Strikes Back.
Theory Comput.
17 (2021)
Noga Ron-Zewi
,
Ivona Bezáková
,
László A. Végh
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword.
Theory Comput.
17 (2021)
Dmitry Gavinsky
The Layer Complexity of Arthur-Merlin-like Communication.
Theory Comput.
17 (2021)
Josh Alman
Limits on the Universal Method for Matrix Multiplication.
Theory Comput.
17 (2021)
Michael A. Forbes
,
Amir Shpilka
,
Iddo Tzameret
,
Avi Wigderson
Proof Complexity Lower Bounds from Algebraic Circuit Complexity.
Theory Comput.
17 (2021)
Igor Carboni Oliveira
,
Ján Pich
,
Rahul Santhanam
Hardness Magnification Near State-of-the-Art Lower Bounds.
Theory Comput.
17 (2021)
Mark Bun
,
Justin Thaler
.
Theory Comput.
17 (2021)
Jack Murtagh
,
Omer Reingold
,
Aaron Sidford
,
Salil P. Vadhan
Deterministic Approximation of Random Walks in Small Space.
Theory Comput.
17 (2021)
Matthias Christandl
,
Péter Vrana
,
Jeroen Zuiddam
Barriers for Fast Matrix Multiplication from Irreversibility.
Theory Comput.
17 (2021)
volume 16, 2020
Chandra Chekuri
,
Shi Li
On the Hardness of Approximating the k-Way Hypergraph Cut problem.
Theory Comput.
16 (2020)
Andrej Bogdanov
,
Siyao Guo
,
Ilan Komargodski
Threshold Secret Sharing Requires a Linear-Size Alphabet.
Theory Comput.
16 (2020)
Roksana Baleshzar
,
Deeparnab Chakrabarty
,
Ramesh Krishnan S. Pallavoor
,
Sofya Raskhodnikova
,
C. Seshadhri
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps.
Theory Comput.
16 (2020)
Mark Bun
,
Robin Kothari
,
Justin Thaler
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials.
Theory Comput.
16 (2020)
Parikshit Gopalan
,
Amir Yehudayoff
Concentration for Limited Independence via Inequalities for the Elementary Symmetric Polynomials.
Theory Comput.
16 (2020)
Noga Alon
,
Elchanan Mossel
,
Robin Pemantle
Distributed Corruption Detection in Networks.
Theory Comput.
16 (2020)
Lijie Chen
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product.
Theory Comput.
16 (2020)
Yuval Filmus
Special Issue: CCC 2019: Guest Editor's Foreword.
Theory Comput.
16 (2020)
Iftach Haitner
,
Thomas Holenstein
,
Omer Reingold
,
Salil P. Vadhan
,
Hoeteck Wee
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing.
Theory Comput.
16 (2020)
Tom Gur
,
Govind Ramnarayan
,
Ron Rothblum
Relaxed Locally Correctable Codes.
Theory Comput.
16 (2020)
Anindya De
,
Ryan O'Donnell
,
Rocco A. Servedio
Sharp Bounds for Population Recovery.
Theory Comput.
16 (2020)
Alessandro Chiesa
,
Peter Manohar
,
Igor Shinkar
On Axis-Parallel Tests for Tensor Product Codes.
Theory Comput.
16 (2020)
Pavel Hrubes
On the Complexity of Computing a Random Boolean Function Over the Reals.
Theory Comput.
16 (2020)
Mohammad Bavarian
,
Badih Ghazi
,
Elad Haramaty
,
Pritish Kamath
,
Ronald L. Rivest
,
Madhu Sudan
Optimality of Correlated Sampling Strategies.
Theory Comput.
16 (2020)
Ankit Garg
,
Mika Göös
,
Pritish Kamath
,
Dmitry Sokolov
Monotone Circuit Lower Bounds from Resolution.
Theory Comput.
16 (2020)
Zeev Dvir
,
Allen Liu
Fourier and Circulant Matrices are Not Rigid.
Theory Comput.
16 (2020)