Complexity bounds for the rational Newton-Puiseux algorithm...

Applicable Algebra in Engineering, Communication and Computing 2011 / 05 Vol. 22; Iss. 3

Complexity bounds for the rational Newton-Puiseux algorithm over finite fields

Adrien Poteaux, Marc Rybowicz
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
22
Language:
english
Pages:
31
DOI:
10.1007/s00200-011-0144-6
Date:
May, 2011
File:
PDF, 656 KB
english, 2011
Conversion to is in progress
Conversion to is failed