default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 30
Volume 30, Number 1, June 2021
- Orr Paradise:
Smooth and Strong PCPs. 1 - Fedor Part, Iddo Tzameret:
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli. 2 - Ronen Shaltiel, Jad Silbak:
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. 3 - Susanna F. de Rezende
, Or Meir, Jakob Nordström, Robert Robere:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. 4 - Mark Giesbrecht, Armin Jamshidpey, Éric Schost:
Subquadratic-Time Algorithms for Normal Bases. 5 - Ben Lee Volk, Mrinal Kumar:
Lower Bounds for Matrix Factorization. 6 - Jacobo Torán, Florian Wörz:
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. 7 - Pranav Bisht, Nitin Saxena:
Blackbox identity testing for sum of special ROABPs and its border class. 8 - Orr Paradise:
Correction to: Smooth and Strong PCPs. 9
Volume 30, Number 2, December 2021
- Toniann Pitassi, Morgan Shirley, Thomas Watson:
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. 10 - Alexander A. Sherstov:
The hardest halfspace. 11 - Tom Gur, Yang P. Liu, Ron D. Rothblum:
An Exponential Separation Between MA and AM Proofs of Proximity. 12 - Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. 13 - Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. 14 - Amit Sinhababu, Thomas Thierauf:
Factorization of Polynomials Given by Arithmetic Branching Programs. 15 - Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. 16
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-01-14 21:03 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:
