External Links

    Journal: Computational Complexity

    Volume 28, Issue 4

    545 -- 572Suryajith Chillara, Partha Mukhopadhyay. Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach
    573 -- 616Benny Applebaum, Pavel Raykov. On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
    617 -- 659Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay. Simulation Theorems via Pseudo-random Properties
    661 -- 708Or Meir. On Derandomized Composition of Boolean Functions
    709 -- 747Oded Goldreich 0001. Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity
    749 -- 828Neeraj Kayal, Vineet Nair, Chandan Saha 0001. Average-case linear matrix factorization and reconstruction of low width algebraic branching programs

    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

    Volume 28, Issue 2

    145 -- 183Or Meir, Avi Wigderson. Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds
    185 -- 239Pavel Pudlák, Neil Thapen. Random resolution refutations
    241 -- 257Anshul Adve, Colleen Robichaux, Alexander Yong. Vanishing of Littlewood-Richardson polynomials is in P
    259 -- 343Roei Tell. Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials

    Volume 28, Issue 1

    1 -- 25Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff. Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound
    27 -- 56Matthias Christandl, Jeroen Zuiddam. Tensor surgery and tensor rank
    57 -- 111Matthias Christandl, Péter Vrana, Jeroen Zuiddam. Asymptotic tensor rank of graph tensors: beyond matrix multiplication
    113 -- 144Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson 0001. Query-to-Communication Lifting for P NP
    runs on