Type of Document	Dissertation
Author	Novocin, Andrew
Author's Email Address	anovocin@math.fsu.edu
URN	etd-04132008-193323
Title	Factoring Univariate Polynomials over the Rationals
Degree	Doctor of Philosophy
Department	Mathematics, Department of
Advisory Committee	Advisor Name Title Mark van Hoeij Committee Chair Amod Agashe Committee Member Ettore Aldrovandi Committee Member Paolo Aluffi Committee Member Robert van Engelen Committee Member
Keywords	Factoring Symbolic Computation Computer Algebra Complexity Algorithms Polynomials
Date of Defense	2008-04-09
Availability	unrestricted
Abstract This thesis presents an algorithm for factoring polynomials over the rationals which follows the approach of the van Hoeij algorithm. The key theoretical novelty in our approach is that it is set up in a way that will make it possible to prove a new complexity result for this algorithm which was actually observed on prior algorithms. One difference of this algorithm from prior algorithms is the practical improvement which we call early termination. Our algorithm should outperform prior algorithms in many common classes of polynomials (including irreducibles).
Files	Filename       Size       Approximate Download Time (Hours:Minutes:Seconds)     28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access    NovocinASpring2008.pdf 470.08 Kb 00:02:10 00:01:07 00:00:58 00:00:29 00:00:02