Volume 33, Issue 1 | computational complexity

Search all computational complexity articles

Volume 33, Issue 1

June 2024

Filter by

Volume:

Sort by

Date published:

New to old Old to new

7 articles in this issue

Algebraic Global Gadgetry for Surjective Constraint Satisfaction
Hubie Chen
OriginalPaper Open access 29 May 2024 Article: 7
Streaming approximation resistance of every ordering CSP
Noah G. Singer
Madhu Sudan
Santhoshini Velusamy
OriginalPaper Open access 29 May 2024 Article: 6
Limits of Preprocessing
Yuval Filmus
Yuval Ishai
Guy Kindler
OriginalPaper Open access 23 May 2024 Article: 5
KRW Composition Theorems via Lifting
Susanna F. de Rezende
Or Meir
Robert Robere
OriginalPaper 29 April 2024 Article: 4
Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply \(\text{VP} \neq \text{VNP}\)
Pranjal Dutta
Nitin Saxena
Thomas Thierauf
OriginalPaper Open access 16 April 2024 Article: 3
On Blocky Ranks Of Matrices
Daniel Avraham
Amir Yehudayoff
OriginalPaper Open access 06 March 2024 Article: 2
Approximating the chromatic polynomial is as hard as computing it exactly
Ferenc Bencs
Jeroen Huijben
Guus Regts
OriginalPaper Open access 18 January 2024 Article: 1