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. In Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté, editors, 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany. Volume 254 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Abstract

Abstract is missing.