External Links

    Journal: Computational Complexity

    Volume 28, Issue 3

    345 -- 408Jin-yi Cai, Xi Chen 0001. A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
    409 -- 435Mrinal Kumar 0001. A quadratic lower bound for homogeneous algebraic branching programs
    437 -- 469Martijn Baartse, Klaus Meer. Interactive proofs and a Shamir-like result for real number computations
    471 -- 542Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan 0001. Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees
    543 -- 544Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson 0001. Correction to: Query-to-Communication Lifting for P NP
    runs on