## Introduction to Symbolic-Numeric Computational Algebra (Lecture 2)

The approximate polynomial gcd problem

George Labahn (University of Waterloo)

In this lecture numerical methods for quotient, remainder, euclidean and gcd are discussed. We also discuss the new Maple SNAP (Symbolic Numeric Algorithms for Polynomials) package.