ON THE MINIMAL POLYNOMIAL OF A MATRIX (Q5696967): Difference between revisions

@@ Property / cites work @@
+The complexity of matrix rank and feasible systems of linear equations
+Normal rank
@@ Property / cites work @@
+On computing the determinant in small parallel time using a small number of processors
+Normal rank
@@ Property / cites work @@
+Fast parallel matrix and GCD computations
@@ Property / cites work: Fast parallel matrix and GCD computations / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Parallel Matrix Inversion Algorithms
@@ Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3254327
@@ Property / cites work: Q3254327 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Analysis
@@ Property / cites work: Matrix Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the characteristic and the minimal polynomial.
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Making Nondeterminism Unambiguous
@@ Property / cites work: Making Nondeterminism Unambiguous / rank @@
+Normal rank
@@ Property / cites work @@
+Verifying the determinant in parallel
@@ Property / cites work: Verifying the determinant in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5696967