A fast parallel algorithm to compute the rank of a matrix over an arbitrary field |
| |
| Authors: | Ketan Mulmuley |
| |
| Institution: | (1) EECS Department, Computer Sci. Division, University of California, 94720 Berkeley, CA, USA |
| |
| Abstract: | It is shown that the rank of a matrix over an arbitrary field can be computed inO(log2
n) time using a polynomial number of processors.
Also appeared in ACM Symposium on Theory of Computing, May 28–30, 1986 Berkeley, California. Research supported by Miller
Fellowship, University of California, Berkeley. |
| |
| Keywords: | 68 C 05 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
