A sparse polynomial (also called a lacunary polynomial) is a polynomial ...
Tensor parameters that are amortized or regularized over large tensor po...
We give reconstruction algorithms for subclasses of depth-3 arithmetic
c...
We say that two given polynomials f, g ∈ R[X], over a ring R, are
equiva...
In this work, we extend the robust version of the Sylvester-Gallai theor...
In this work, we study linear error-correcting codes against adversarial...
In this work, we study linear error-correcting codes against adversarial...
The stabilizer rank of a quantum state ψ is the minimal r such that
| ψ⟩...
In this paper we study polynomials in VP_e (polynomial-sized
formulas) a...
In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS1...
In this work we prove a version of the Sylvester-Gallai theorem for quad...
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most
u...
This work gives an explicit construction of a family of error correcting...
We prove Sylvester-Gallai type theorems for quadratic polynomials.
Speci...
This work proves new results on the ability of binary Reed-Muller codes ...
In this paper we study the complexity of constructing a hitting set for ...