Geometric aspects of Iterated Matrix Multiplication
نویسندگان
چکیده
منابع مشابه
Gemetric Aspects of Iterated Matrix Multiplication
This paper studies geometric properties of the Iterated Matrix Multiplication polynomial and the hypersurface that it defines. We focus on geometric aspects that may be relevant for complexity theory such as the symmetry group of the polynomial, the dual variety and the Jacobian loci of the hypersurface, that are computed with the aid of representation theory of quivers.
متن کاملPerformance aspects of sparse matrix-vector multiplication
Sparse matrix-vector multiplication (shortly SpM×V) is an important building block in algorithms solving sparse systems of linear equations, e.g., FEM. Due to matrix sparsity, the memory access patterns are irregular and utilization of the cache can suffer from low spatial or temporal locality. Approaches to improve the performance of SpM×V are based on matrix reordering and register blocking [...
متن کاملA Depth-Five Lower Bound for Iterated Matrix Multiplication
We prove that certain instances of the iterated matrix multiplication (IMM) family of polynomials with N variables and degree n require NΩ( √ n) gates when expressed as a homogeneous depth-five ΣΠΣΠΣ arithmetic circuit with the bottom fan-in bounded by N1/2−ε. By a depth-reduction result of Tavenas, this size lower bound is optimal and can be achieved by the weaker class of homogeneous depth-fo...
متن کاملOn Circuit Complexity Classes and Iterated Matrix Multiplication
OF THE DISSERTATION On Circuit Complexity Classes and Iterated Matrix Multiplication by Fengming Wang Dissertation Director: Eric Allender In this thesis, we study small, yet important, circuit complexity classes within NC, such as ACC and TC. We also investigate the power of a closely related problem called Iterated Matrix Multiplication and its implications in low levels of algebraic complexi...
متن کاملThe Complexity of Iterated Multiplication
For a monoid G the iterated multiplication problem is the computa tion of the product of n elements fromG By re ning known completeness arguments we show that as G varies over a natural series of important groups and monoids the iterated multiplication problems are complete for most natural low level complexity classes The completeness is with respect to rst order projections low level reductio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2016
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2016.04.028