Abstract
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/. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
