The Computational Complexity of Some Pro
โ
Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 330 KB
We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=