Pages that link to "Item:Q5262755"
From MaRDI portal
The following pages link to Efficient computation of the characteristic polynomial (Q5262755):
Displayed 7 items.
- On the permanental polynomials of matrices (Q745925) (← links)
- Determinisability of unary weighted automata over the rational numbers (Q2055977) (← links)
- Computational complexity of \(k\)-block conjugacy (Q2219057) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- List decoding of number field codes (Q2249795) (← links)
- Finding Hamming weights without looking at truth tables (Q2392677) (← links)
- Spectral norm of a symmetric tensor and its computation (Q5113665) (← links)