@inproceedings{f5cf16b1d693435290659e5a372bacf5,
title = "On the complexity of multivariate polynomial division",
abstract = "In this paper, we present a new algorithm for reducing a multivariate polynomial with respect to an autoreduced tuple of other polynomials. In a suitable sparse complexity model, it is shown that the execution time is essentially the same (up to a logarithmic factor) as the time needed to verify that the result is correct.",
keywords = "Algorithm, Complexity, Division, Sparse reduction",
author = "\{van der Hoeven\}, Joris",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 21st International Conference on Applications of Computer Algebra, ACA 2015 ; Conference date: 20-07-2015 Through 23-07-2015",
year = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-56932-1\_28",
language = "English",
isbn = "9783319569307",
series = "Springer Proceedings in Mathematics and Statistics",
publisher = "Springer New York LLC",
pages = "447--458",
editor = "Kotsireas, \{Ilias S.\} and Edgar Martinez-Moro",
booktitle = "Applications of Computer Algebra",
}