Journal of Algorithms
Apolarity and canonical forms for homogeneous polynomials
European Journal of Combinatorics - Special issue dedicated to Bernt Lindstro¨m
Communication complexity
An exponential lower bound for depth 3 arithmetic circuits
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
SIAM Journal on Computing
Affine projections of symmetric polynomials
Journal of Computer and System Sciences - Complexity 2001
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Interpolation of depth-3 arithmetic circuits with two multiplication gates
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Symmetric Tensors and Symmetric Tensor Rank
SIAM Journal on Matrix Analysis and Applications
Lie Groups and Lie Algebras
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Tensor-rank and lower bounds for arithmetic formulas
Proceedings of the forty-second ACM symposium on Theory of computing
Computing symmetric rank for symmetric tensors
Journal of Symbolic Computation
New Results on Noncommutative and Commutative Polynomial Identity Testing
Computational Complexity
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Algebraic Complexity Theory
Geometric complexity theory and tensor rank
Proceedings of the forty-third annual ACM symposium on Theory of computing
Tensor Rank: Some Lower and Upper Bounds
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Partial Derivatives in Arithmetic Complexity and Beyond (Foundations and Trends(R) in Theoretical Computer Science)
Equivalence of F-algebras and cubic forms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Efficient algorithms for some special cases of the polynomial equivalence problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
An m-variate polynomial f is said to be an affine projection of some n-variate polynomial g if there exists an nm matrix A and an n-dimensional vector b such that f(x)=g(Ax+b). In other words, if f can be obtained by replacing each variable of g by an affine combination of the variables occurring in f, then it is said to be an affine projection of g. Some well known problems (such as the determinant versus permanent and matrix multiplication for example) are instances of this problem. Given f and g can we determine whether f is an affine projection of g? The intention of this paper is to understand the complexity of the corresponding computational problem: given polynomials f and g find A and b such that f=g(Ax+b), if such an (Ab) exists. We first show that this is an NP-hard problem. We then focus our attention on instances where g is a member of some fixed, well known family of polynomials so that the input consists only of the polynomial f(x) having m variables and degree d. We consider the situation where f(x) is given to us as a blackbox (i.e. for any point aFm we can query the blackbox and obtain f(a) in one step) and devise randomized algorithms with running time poly(mnd) in the following special cases. Firstly where g is the Permanent (respectively the Determinant) of an nxn matrix and A is of rank n2. Secondly where g is the sum of powers polynomial (respectively the sum of products polynomial), and A is a random matrix of the appropriate dimensions (also d should not be too small).