Login / Signup

NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials.

Omkar BaraskarAgrim DewanChandan SahaPulkit Sinha
Published in: ICALP (2024)
Keyphrases
  • np hardness
  • high dimensional
  • approximation algorithms
  • test cases