Search
Now showing items 1-2 of 2
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 ...
Towards a Charcterization of the Symmetries of the Nisan-Wigderson Polynomial Family
(2018-07-09)
Understanding the structure and complexity of a polynomial family is a fundamental problem of arithmetic circuit complexity. There are various approaches like studying the lower bounds, which deals with nding the smallest ...