Nicola Galesi

most citedSpace proof complexity for random

3

-CNFs via a

(2 - ε)

-Hall's Theorem

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CC2023

On the algebraic proof complexity of Tensor Isomorphism

Nicola Galesi, Joshua A. Grochow, Toniann Pitassi +1

The Tensor Isomorphism problem (TI) has recently emerged as having connections to multiple areas of research within complexity and beyond, but the current best upper bound is essen…

cs.CC2014★ 2 cited

Space proof complexity for random $3$ -CNFs via a $(2 - ε)$ -Hall's Theorem

Ilario Bonacina, Nicola Galesi, Tony Huynh +1

We investigate the space complexity of refuting $3$ -CNFs in Resolution and algebraic systems. No lower bound for refuting any family of $3$ -CNFs was previously known for the total…

On the algebraic proof complexity of Tensor Isomorphism

Space proof complexity for random 3-CNFs via a (2−ε)-Hall's Theorem

Space proof complexity for random $3$ -CNFs via a $(2 - ε)$ -Hall's Theorem