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]

@inproceedings{ChillaraGS23,
  title = {On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts},
  author = {Suryajith Chillara and Coral Grichener and Amir Shpilka},
  year = {2023},
  doi = {10.4230/LIPIcs.STACS.2023.22},
  url = {https://doi.org/10.4230/LIPIcs.STACS.2023.22},
  researchr = {https://researchr.org/publication/ChillaraGS23},
  cites = {0},
  citedby = {0},
  booktitle = {40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany},
  editor = {Petra Berenbrink and Patricia Bouyer and Anuj Dawar and Mamadou Moustapha Kanté},
  volume = {254},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-266-2},
}