Pages that link to "Item:Q1766817"
From MaRDI portal
The following pages link to On the complexity of computing determinants (Q1766817):
Displaying 33 items.
- A fast algorithm to construct a representation for transversal matroids (Q263073) (← links)
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH (Q404920) (← links)
- Interpolation in Valiant's theory (Q451113) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Critical groups of graphs with dihedral actions. II. (Q730250) (← links)
- On the complexity of inverting integer and polynomial matrices (Q901933) (← links)
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries (Q990537) (← links)
- On the extension of Sarrus' rule to \(n \times n\) (\(n > 3\)) matrices: development of new method for the computation of the determinant of \(4 \times 4\) matrix (Q1653536) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Probabilistic analysis of block Wiedemann for leading invariant factors (Q2048159) (← links)
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix (Q2100051) (← links)
- Efficient sampling in spectrahedra and volume approximation (Q2144244) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- More extensions of a determinant inequality of Hartfiel (Q2287571) (← links)
- Graph characterization by counting sink star subgraphs (Q2360843) (← links)
- The shifted number system for fast linear algebra on integer matrices (Q2387425) (← links)
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419) (← links)
- A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
- AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES (Q2875648) (← links)
- Efficient Disjointness Tests for Private Datasets (Q3511159) (← links)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
- FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME (Q3586406) (← links)
- Solving p-adic polynomial systems via iterative eigenvector algorithms (Q5064503) (← links)
- Zariski chambers on surfaces of high Picard number (Q5169636) (← links)
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields (Q5418498) (← links)
- Asymptotically fast polynomial matrix algorithms for multivariable systems (Q5423851) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
