default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 29
Volume 29, Number 1, June 2020
- Hiro Ito, Areej Khoury, Ilan Newman:
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs. 1 - Thomas Watson:
Communication Complexity with Small Advantage. 2 - Or Meir:
Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation. 4 - Thomas Watson:
Correction to: Communication complexity with small advantage. 3 - Ilia Ponomarenko, Andrey Vasil'ev
:
Two-closures of supersolvable permutation groups in polynomial time. 5
Volume 29, Number 2, December 2020
- Pavel Hrubes:
On ε-sensitive monotone computations. 6 - Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. 7 - Nick Fischer, Christian Ikenmeyer:
The Computational Complexity of Plethysm Coefficients. 8 - Rohit Gurjar, Thomas Thierauf:
Linear Matroid Intersection is in Quasi-NC. 9
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-04-08 00:09 CEST 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:
