Equivalence test for read-once arithmetic formulas

DOI10.1137/1.9781611977554.CH162MaRDI QIDQ6538695zbMATH OpenFDO

Authors N. Gupta, Chandan Saha, Bhargav Thankey

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH162

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
• Testing equivalence to design polynomials
• Towards identity testing for sums of products of Read-once and multilinear bounded-Read formulae
• On the hardness of order finding and equivalence testing for ROABPs

This page was built for publication: Equivalence test for read-once arithmetic formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538695)