A. Markov. Theory of Algorithms, Academy of Sciences of the USSR, Moscow, 1954. 59  Home/Search   Document Not in Database   Summary   Related Articles

....consider square matrices with integer entries. The matrix representability problem is to decide, for a given matrix A and a set of matrices M = fA 1 ; A k g, whether A can be expressed as a product of matrices in M. This problem was shown to be undecidable for 6 Theta 6 matrices by Markov [Mar54] and was later improved to 4 Theta 4 matrices [Mar58] Venkatesan and Rajagopalan [VR92] considered bounded version of this problem for 20 Theta 20 matrices as follows. The size of a matrix A = a ij ) n Thetan , denoted by jAj, is equal to P n i=1 P n j=1 ja ij j, where a ij is in binary ....

A. Markov. Theory of Algorithms, Academy of Sciences of the USSR, Moscow, 1954. 59

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC