Browsing Computer Science and Automation (CSA) by Subject "Nisan-Wigderson design polynomials"
Now showing items 1-1 of 1
-
On symmetries of and equivalence tests for two polynomial families and a circuit class
Two polynomials f, g ∈ F[x1, . . . , xn] over a field F are said to be equivalent if there exists an n×n invertible matrix A over F such that g = f(Ax), where x = (x1 · · · xn)T . The equivalence test (in short, ET) for ...