Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > HESSIAN DETERMINANT:
Reports tagged with Hessian determinant:
TR22-099 | 14th July 2022
Nikhil Gupta, Chandan Saha, Bhargav Thankey

#### Equivalence Test for Read-Once Arithmetic Formulas

We study the polynomial equivalence problem for orbits of read-once arithmetic formulas (ROFs). Read-once formulas have received considerable attention in both algebraic and Boolean complexity and have served as a testbed for developing effective tools and techniques for analyzing circuits. Two $n$-variate polynomials $f, g \in \mathbb{F}[\mathbf{x}]$ are equivalent, denoted ... more >>>

ISSN 1433-8092 | Imprint