Skip to main content

computational complexity

Ausgabe 2/2020

Inhalt (4 Artikel)

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction

Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe

Open Access

The Computational Complexity of Plethysm Coefficients

Nick Fischer , Christian Ikenmeyer

Linear Matroid Intersection is in Quasi-NC

Rohit Gurjar , Thomas Thierauf