External Links

    Journal: Computational Complexity

    Volume 29, Issue 2

    6 -- 0Pavel Hrubes. On ε-sensitive monotone computations
    7 -- 0Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe 0001. The Robustness of LWPP and WPP, with an Application to Graph Reconstruction
    8 -- 0Nick Fischer, Christian Ikenmeyer. The Computational Complexity of Plethysm Coefficients
    9 -- 0Rohit Gurjar, Thomas Thierauf. Linear Matroid Intersection is in Quasi-NC

    Volume 29, Issue 1

    1 -- 0Hiro Ito, Areej Khoury, Ilan Newman. On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
    2 -- 0Thomas Watson 0001. Communication Complexity with Small Advantage
    3 -- 0Thomas Watson 0001. Correction to: Communication complexity with small advantage
    4 -- 0Or Meir. Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation
    5 -- 0Ilia Ponomarenko, Andrey Vasil'ev. Two-closures of supersolvable permutation groups in polynomial time
    runs on