Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 1991 Copyright 1991 University of Bonn, Department of Computer Science, Abt. V
8566

 Computational Complexity of Sparse Rational Interpolation
Dima Grigoriev, Marek Karpinski, Michael F. Singer
[Download PostScript] [Download PDF]

% We give a new algorithm for sparse rational interpolation. % This is the first deterministic algorithm with singly exponential % bounds on the number of arithmetic operations

Last Change: 08/18/99 at 13:00:38
 Deutsch 		University of Bonn -> Department of Computer Science -> Chair V