On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains
In this paper we show some lower bounds for the size of multiplicative circuits computing multi-output functions in some noncommutative domains such as monoids and finite groups. We also introduce and study a generalization of linear circuits in which the goal is to compute MY where Y is a vector of indeterminates and M is a matrix whose entries come from noncommutative rings. We show some lower bounds in this setting as well.
Unable to display preview. Download preview PDF.
- 8.Nisan, N.: Lower bounds for non-commutative computation (extended abstract). In: STOC, pp. 410–418 (1991)Google Scholar