default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 17
Volume 17, 2021
- Josh Alman:
Limits on the Universal Method for Matrix Multiplication. 1-30 - Matthias Christandl, Péter Vrana
, Jeroen Zuiddam:
Barriers for Fast Matrix Multiplication from Irreversibility. 1-32 - Noga Ron-Zewi, Ivona Bezáková, László A. Végh:
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. 1-4 - Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. 1-35 - Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. 1-27 - Julia Chuzhoy, David Hong Kyun Kim, Rachit Nimavat:
Almost Polynomial Hardness of Node-Disjoint Paths in Grids. 1-57 - Mark Bun, Justin Thaler:
The Large-Error Approximate Degree of AC0. 1-46 - Dmitry Gavinsky:
The Layer Complexity of Arthur-Merlin-like Communication. 1-28 - Ryan O'Donnell, Tselil Schramm:
Sherali-Adams Strikes Back. 1-30 - Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. 1-88 - Igor C. Oliveira, Ján Pich, Rahul Santhanam:
Hardness Magnification Near State-of-the-Art Lower Bounds. 1-38
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-12-05 22:24 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:
