Pages that link to "Item:Q2238844"
From MaRDI portal
The following pages link to Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844):
Displaying 15 items.
- Acceleration of computation of determinants and characteristic polynomials without divisions (Q557431) (← links)
- Dynamic normal forms and dynamic characteristic polynomial (Q633626) (← links)
- An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix (Q1286098) (← links)
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs (Q1404687) (← links)
- On the complexity of computing determinants (Q1766817) (← links)
- Efficient sampling in spectrahedra and volume approximation (Q2144244) (← links)
- On finding multiplicities of characteristic polynomial factors of black-box matrices (Q2883810) (← links)
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix (Q2985828) (← links)
- Determinant: Old algorithms, new insights (Q5054863) (← links)
- Out of Non-linearity: Search Impossible Differentials by the Bitwise Characteristic Matrix (Q5095923) (← links)
- Multi-linear formulas for permanent and determinant are of super-polynomial size (Q5901079) (← links)
- Efficient algorithms for computing the characteristic polynomial in a domain (Q5928850) (← links)
- Effective lower bounds on the matrix rank and their applications (Q6535147) (← links)
- Generic polynomial algorithms for the knapsack problem in some matrix semigroups (Q6587364) (← links)
- Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal (Q6641147) (← links)
