Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Giesbrecht, Mark - School of Computer Science, University of Waterloo
On Computing the Determinant and Smith Form of an Integer Matrix Wayne Eberly
Approximate Polynomial Decomposition Robert M. Corlessyz
On Computing the Determinant and Smith Form of an Integer Matrix Wayne Eberly
Efficient Decomposition of Associative Algebras Department of Computer Science
Non-Commutative Grobner Bases in Poincare-Birkhoff-Witt Mark Giesbrecht1
Numerical implicitization of parametric hypersurfaces with linear algebra ?
Approximate Polynomial Decomposition \Lambda Robert M. Corless yz Mark W. Giesbrecht z David J. Jeffrey y Stephen M. Watt zy
J. Symbolic Computation (1997) 0, 1--000. To appear. Factoring in SkewPolynomial Rings
E#cient Parallel Solution of Sparse Systems of Linear Diophantine Equations + Mark Giesbrecht
Certifying Inconsistency of Sparse Linear Systems M. Giesbrecht
E#cient Decomposition of Associative Algebras # W. Eberly +
Efficient Decomposition of Associative Algebras over Finite Fields \Lambda
NonCommutative Grobner Bases PoincareBirkho#Witt Mark Giesbrecht
E cient Decomposition of Associative Algebras over Finite Fields
Some Results on the Functional Decomposition of Polynomials
J. Symbolic Computation (1997) 0, 1000. To appear. Factoring in Skew-Polynomial Rings
Efficient Parallel Solution of Sparse Systems of Linear Diophantine Equations Mark Giesbrecht
