NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Baraskar, Omkar, Dewan, Agrim, Saha, Chandan, Sinha, Pulkit
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2410.12251