1[1]Bondy J A and Murty U S[J]. Graph theory with applications, 1988
2[2]Burgisser P Completeness and reduction in algebraic complexity theory[M]. Springer-Verlag Berlin Heideberg, 2000
3[3]Mahajan M and Vinay V. Determinant: Old algorithms, new insights[J ]. SIAM J Discrete Mathematics, 1999,12 (4) :474～490
4[4]Minh Hoang T and Thierauf T. The complexity of verifying the characteristic polynominal and testing similarity[ M ]. Proceedings of 15th annual IEEE conference on computational complexity, edited by M. Titsworth, 2000 87～95
5[5]Zeiberger D A combinatorial approach to matrix algebra[J]. Discrete Mathematics, 1985, 56 67～72
