Browsing Computer Science and Automation (CSA) by Subject "Trace iterated matrix multiplication polynomial"
Now showing items 1-1 of 1
-
Equivalence test for the trace iterated matrix multiplication polynomial
An m-variate polynomial f is affine equivalent to an n-variate polynomial g if m > n and there is a full rank n * m matrix A and a n-dimensional vector b such that f(x) = g(Ax + b). Given blackbox access to f and g (i.e ...