M. Giesbrecht

most citedOn Parametric Linear System Solving

4 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing cs.SCShow all

4 papers · 1 filter

cs.SC2026

Computing Smith Forms Modulo $p^{2}$ of Sparse Matrices Faster Than Matrix Multiplication

Mark Giesbrecht

Let $p$ be a prime and $R = Z / p^{2} Z$ the ring of integers modulo $p^{2}$ . Any $A \in R^{n \times n}$ is unimodularly equivalent to its Smith form \[ S=diag\bigl(\underbr…

cs.SC2026

On Factoring Quantum-Plane Skew Polynomials over $Q (I ¨ ) (t)$

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 \ma…

cs.SC2026

Fast Deterministic Normal Bases and Circulant Polynomial Determinants

Mark Giesbrecht, Armin Jamshidpey, Ãric Schost

Let $E = F_{q} [x] / (I^)$ be an algebraic extension of degree $n$ over the finite field $F_{q}$ , given by a $I^ \in F_{q} [x]$ monic and irreducible. It is clas…

cs.SC2025

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…

Computing Smith Forms Modulo p2 of Sparse Matrices Faster Than Matrix Multiplication

On Factoring Quantum-Plane Skew Polynomials over Q(I¨)(t)

Fast Deterministic Normal Bases and Circulant Polynomial Determinants

Refined bit complexity for the computation of at least one point per connected component of a smooth complete intersection real algebraic set

Computing Smith Forms Modulo $p^{2}$ of Sparse Matrices Faster Than Matrix Multiplication

On Factoring Quantum-Plane Skew Polynomials over $Q (I ¨ ) (t)$