On the complexity of computing determinants

From MaRDI portal
Revision as of 07:24, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1766817

DOI10.1007/S00037-004-0185-3zbMath1061.68185DBLPjournals/cc/KaltofenV05OpenAlexW2161330625WikidataQ56459440 ScholiaQ56459440MaRDI QIDQ1766817

Gilles Villard, Erich L. Kaltofen

Publication date: 1 March 2005

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: http://www.lib.ncsu.edu/resolver/1840.2/87




Related Items (34)

Graph characterization by counting sink star subgraphsFaster geometric algorithms via dynamic determinant computationEfficient sampling in spectrahedra and volume approximationSolving p-adic polynomial systems via iterative eigenvector algorithmsThe shifted number system for fast linear algebra on integer matricesOn 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\) matrixFast, deterministic computation of the Hermite normal form and determinant of a polynomial matrixProjective interpolation of polynomial vectors and improved key recovery attack on SFLASHComputing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline CohomologySparse resultants and straight-line programsHigh-order lifting for polynomial Sylvester matricesEfficient Disjointness Tests for Private DatasetsOn the complexity of inverting integer and polynomial matricesA fraction free matrix Berlekamp/Massey algorithmInterpolation in Valiant's theoryFinding the Growth Rate of a Regular of Context-Free Language in Polynomial TimeRelaxed Hensel lifting of triangular setsDeterministic computation of the characteristic polynomial in the time of matrix multiplicationEfficient computation of the characteristic polynomial of a threshold graphMultilinear polynomial systems: root isolation and bit complexityAn 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fieldsZariski chambers on surfaces of high Picard numberKaltofen's division-free determinant algorithm differentiated for matrix adjoint computationEssentially optimal computation of the inverse of generic polynomial matricesAsymptotically fast polynomial matrix algorithms for multivariable systemsFINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIMEAn effective algorithm of computing symbolic determinants with multivariate polynomial entriesBlock-Krylov techniques in the context of sparse-FGLM algorithmsCritical groups of graphs with dihedral actions. II.More extensions of a determinant inequality of HartfielProbabilistic analysis of block Wiedemann for leading invariant factorsA fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrixAN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPESA fast algorithm to construct a representation for transversal matroids







This page was built for publication: On the complexity of computing determinants