DOI10.1007/s00037-004-0185-3zbMath1061.68185OpenAlexW2161330625WikidataQ56459440 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
Graph characterization by counting sink star subgraphs,
Faster geometric algorithms via dynamic determinant computation,
Efficient sampling in spectrahedra and volume approximation,
Solving p-adic polynomial systems via iterative eigenvector algorithms,
The shifted number system for fast linear algebra on integer matrices,
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,
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix,
Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH,
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology,
Sparse resultants and straight-line programs,
High-order lifting for polynomial Sylvester matrices,
Efficient Disjointness Tests for Private Datasets,
On the complexity of inverting integer and polynomial matrices,
A fraction free matrix Berlekamp/Massey algorithm,
Interpolation in Valiant's theory,
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time,
Relaxed Hensel lifting of triangular sets,
Deterministic computation of the characteristic polynomial in the time of matrix multiplication,
Efficient computation of the characteristic polynomial of a threshold graph,
Multilinear polynomial systems: root isolation and bit complexity,
An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields,
Zariski chambers on surfaces of high Picard number,
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation,
Essentially optimal computation of the inverse of generic polynomial matrices,
Asymptotically fast polynomial matrix algorithms for multivariable systems,
FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME,
An effective algorithm of computing symbolic determinants with multivariate polynomial entries,
Block-Krylov techniques in the context of sparse-FGLM algorithms,
Critical groups of graphs with dihedral actions. II.,
More extensions of a determinant inequality of Hartfiel,
Probabilistic analysis of block Wiedemann for leading invariant factors,
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix,
AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES,
A fast algorithm to construct a representation for transversal matroids
