Pages that link to "Item:Q4853329"
From MaRDI portal
The following pages link to COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME (Q4853329):
Displaying 6 items.
- Continuous-time orbit problems are decidable in polynomial-time (Q458374) (← links)
- Counting and generating permutations in regular classes (Q727971) (← links)
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case (Q2349096) (← links)
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (Q5089287) (← links)
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time (Q6142334) (← links)
