Abstract
We consider the boolean complexity of the decomposition of matrix algebras over ℂ and ℝ with bases consisting of matrices over a number field. Deterministic polynomial time algorithms for the decomposition of semi-simple algebras over these fields and Las Vegas polynomial time algorithms for the decomposition of simple algebras are obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
