Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!utcsri!utegc!utai!nishi
From: nishi@utai.UUCP
Newsgroups: ut.theory
Subject: student seminar
Message-ID: <4140@utai.UUCP>
Date: Mon, 2-Nov-87 15:55:01 EST
Article-I.D.: utai.4140
Posted: Mon Nov  2 15:55:01 1987
Date-Received: Tue, 3-Nov-87 02:41:59 EST
Organization: CSRI, University of Toronto
Lines: 11


Here's a brief descripton of the talk Mark will be giving on Wednesday:

The decomposition of polynomials has received considerable attention
recently in computer science. Given a polynomial f, we wish
to find polynomials g and h of specified degrees such that f=g(h).
The complexity of the problem varies wildly depending on the ground
field and the degree of the polynomial involved. We will look at
some of the the computational problems as well as some generalisations
(such as multivariate polynomials and rational functions).
Once again an attempt will be made not to hide behind a wall of algebra.