Circuits, matrices, and nonassociative computation
Marie‐Claude Beaudry, Pierre McKenzie · 2003
It is shown that the formula and circuit evaluation problems in the nonassociative context capture natural complexity classes up to NP, thus extending the known result that the word problem over a groupoid is LOGCFL-complete. The problem of multiplying together matrices whose elements are taken from an algebraic structure more general than a semiring is defined and studied. It is shown that natural variants of this problem are complete for complexity classes such as NL, NC/sup k/, AC/sup k/, SC/sup k/, and NP. In particular, the iterated multiplication problems involving O(log/sup k/ n) matrices over a structure (S; +,.) in which (S; +) is a monoid or an aperiodic monoid are complete for NC/sup k+1/ and for AC/sup k/ respectively, and an iterated multiplication problem variant involving matrices of size O(log/sup k/ n) is complete for SC/sup k/.>