Journal: Computational Complexity

Volume 33, Issue 1

1 -- 0Ferenc Bencs, Jeroen Huijben, Guus Regts. Approximating the chromatic polynomial is as hard as computing it exactly
2 -- 0Daniel Avraham, Amir Yehudayoff. On Blocky Ranks Of Matrices
3 -- 0Pranjal Dutta, Nitin Saxena 0001, Thomas Thierauf. Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply VP ≠q VNP
4 -- 0Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere. KRW Composition Theorems via Lifting
5 -- 0Yuval Filmus, Yuval Ishai, Avi Kaplan, Guy Kindler. Limits of Preprocessing
6 -- 0Noah G. Singer, Madhu Sudan 0001, Santhoshini Velusamy. Streaming approximation resistance of every ordering CSP
7 -- 0Hubie Chen. Algebraic Global Gadgetry for Surjective Constraint Satisfaction