"NP-hardness of testing equivalence to sparse polynomials and to ..."

Omkar Baraskar et al. (2024)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2024-08-08

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/BaraskarD0S24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/BaraskarD0S24
Omkar Baraskar, Agrim Dewan, Chandan Saha, Pulkit Sinha:
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials. Electron. Colloquium Comput. Complex. TR24 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.