30 citations · 70 across the 24 of their papers we have counts for
32 papers
Computing Smith Forms Modulo of Sparse Matrices Faster Than Matrix Multiplication
Mark Giesbrecht
Let be a prime and the ring of integers modulo . Any is unimodularly equivalent to its Smith form \[ S=diag\bigl(\underbr…
On Factoring Quantum-Plane Skew Polynomials over
Mark Giesbrecht
We study algorithms for factorization in the quantum plane of (dilation) skew polynomials over a function field of a cyclotomic field: \[ \mathsf{R}=\mathsf{K}(t)[x;σ], \qquad \mat…
Fast Deterministic Normal Bases and Circulant Polynomial Determinants
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Let describe an algebraic extension of a finite field , where is a prime power and is monic and irreducible…
On Parametric Linear System Solving
Robert M. Corless, Mark Giesbrecht, Leili Rafiee Sevyeri +1
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution i…
Refined bit complexity for the computation of at least one point per connected component of a smooth complete intersection real algebraic set
Jesse Elliott, Mark Giesbrecht, Edern Gillot +2
We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup…
Bit complexity for computing one point in each connected component of a smooth real algebraic set
Jesse Elliott, Mark Giesbrecht, Eric Schost
We analyze the bit complexity of an algorithm for the computation of at least one point in each connected component of a smooth real algebraic set. This work is a continuation of o…