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]

@article{ChillaraGS22,
  title = {On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts},
  author = {Suryajith Chillara and Coral Grichener and Amir Shpilka},
  year = {2022},
  url = {https://eccc.weizmann.ac.il/report/2022/106},
  researchr = {https://researchr.org/publication/ChillaraGS22},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {TR22},
}