Skip to main content

computational complexity

Ausgabe 1/2024

Inhalt (3 Artikel)

Open Access

Approximating the chromatic polynomial is as hard as computing it exactly

Ferenc Bencs, Jeroen Huijben, Guus Regts

Open Access

On Blocky Ranks Of Matrices

Daniel Avraham, Amir Yehudayoff

Open Access

Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply

Pranjal Dutta, Nitin Saxena, Thomas Thierauf