On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts

Suryajith Chillara, Coral Grichener, Amir Shpilka. On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. Electronic Colloquium on Computational Complexity (ECCC), TR22, 2022. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.