Pages that link to "Item:Q5928850"
From MaRDI portal
The following pages link to Efficient algorithms for computing the characteristic polynomial in a domain (Q5928850):
Displaying 6 items.
- Fast algorithms for the characteristic polynomial (Q1058849) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\) (Q2258082) (← links)
- (Q3973334) (← links)
- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets (Q4635358) (← links)
- Effective lower bounds on the matrix rank and their applications (Q6535147) (← links)
