The following pages link to Mark W. Giesbrecht (Q540319):
Displayed 50 items.
- (Q233003) (redirect page) (← links)
- Computing the Hermite form of a matrix of Ore polynomials (Q360186) (← links)
- In honour of the research and influence of Joachim von zur Gathen at 60 (Q412195) (← links)
- In honour of Keith Geddes on his 60th birthday (Q540321) (← links)
- Interpolation of shifted-lacunary polynomials (Q626682) (← links)
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- Factorizations for difference operators (Q738518) (← links)
- Efficient rational creative telescoping (Q820942) (← links)
- Factoring in skew-polynomial rings over finite fields (Q1269751) (← links)
- (Q1432889) (redirect page) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- Computing rational forms of integer matrices (Q1864883) (← links)
- Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (Q1878479) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- Efficient decomposition of associative algebras over finite fields (Q1976671) (← links)
- Counting invariant subspaces and decompositions of additive polynomials (Q1994893) (← links)
- Efficient \(q\)-integer linear decomposition of multivariate polynomials (Q2029008) (← links)
- Subquadratic-time algorithms for normal bases (Q2040602) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- On parametric linear system solving (Q2110215) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- Relating \(p\)-adic eigenvalues and the local Smith normal form (Q2350014) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
- Factoring linear partial differential operators in \(n\) variables (Q2635073) (← links)
- Constructing normal bases in finite fields (Q2639102) (← links)
- (Q2725953) (← links)
- Computing Popov Forms of Matrices Over PBW Extensions (Q2799551) (← links)
- A Symbolic Approach to Compute a Null-Space Basis in the Projection Method (Q2799564) (← links)
- Computing GCRDs of approximate differential polynomials (Q2819716) (← links)
- A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials (Q2914992) (← links)
- Composition collisions and projective polynomials (Q2946530) (← links)
- Towards factoring bivariate approximate polynomials (Q2958917) (← links)
- Solving sparse rational linear systems (Q2958972) (← links)
- Computing Sparse Multiples of Polynomials (Q3060739) (← links)
- (Q3447172) (← links)
- Sparse interpolation over finite fields via low-order roots of unity (Q3452373) (← links)
- Factoring linear differential operators in <i>n</i> variables (Q3452394) (← links)
- On Computing the Hermite Form of a Matrix of Differential Polynomials (Q3644094) (← links)
- (Q4226997) (← links)
- (Q4227282) (← links)
- (Q4227340) (← links)
- (Q4230333) (← links)
- (Q4232484) (← links)
- (Q4234328) (← links)
- (Q4375610) (← links)
- (Q4471950) (← links)
- (Q4474265) (← links)
- (Q4660658) (← links)