External Links

    Journal: Computational Complexity

    Volume 27, Issue 4

    561 -- 593Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam. Constructive non-commutative rank computation is in deterministic polynomial time
    595 -- 616Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost. On semiring complexity of Schur polynomials
    617 -- 670Anurag Pandey, Nitin Saxena 0001, Amit Sinhababu. Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits
    671 -- 716Clément L. Canonne, Tom Gur. An adaptivity hierarchy theorem for property testing

    Volume 27, Issue 3

    351 -- 374Leslie G. Valiant. Some observations on holographic algorithms
    375 -- 462Irit Dinur, Or Meir. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity
    463 -- 509Badih Ghazi, Ilan Komargodski, Pravesh K. Kothari, Madhu Sudan. Communication with Contextual Uncertainty
    511 -- 559Alexander A. Razborov. On Space and Depth in Resolution

    Volume 27, Issue 2

    209 -- 223Benjamin Rossman. The Average Sensitivity of Bounded-Depth Formulas
    225 -- 244Emanuele Viola, Avi Wigderson. Local Expanders
    245 -- 304Mika Göös, Toniann Pitassi, Thomas Watson 0001. The Landscape of Communication Complexity Classes
    305 -- 350Oded Goldreich 0001, Avishay Tal. Matrix rigidity of random Toeplitz matrices

    Volume 27, Issue 1

    1 -- 29Vikraman Arvind, Srikanth Srinivasan 0001. On the hardness of the noncommutative determinant
    31 -- 61Bruno Bauwens, Anton Makhlin, Nikolai K. Vereshchagin, Marius Zimand. Short lists with short programs in short time
    63 -- 97John M. Hitchcock, Hadi Shafei. Autoreducibility of NP-Complete Sets under Strong Hypotheses
    99 -- 207Tom Gur, Ron D. Rothblum. Non-interactive proofs of proximity
    runs on