Journal: Computational Complexity

Volume 33, Issue 2

8 -- 0Miroslav Rada, Michal Cerný, Ondrej Sokol. The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
9 -- 0Laurence Kluge. Combinatorial refinement on circulant graphs
10 -- 0Zeyu Guo 0001. Variety Evasive Subspace Families
11 -- 0Abhranil Chatterjee 0001, Mrinal Kumar 0001, Ben lee Volk. Determinants vs. Algebraic Branching Programs
12 -- 0Ján Pich. Localizability of the approximation method
13 -- 0Dominik Scheder, John P. Steinberger. PPSZ for General k-SAT and CSP - Making Hertli's Analysis Simpler and 3-SAT Faster

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