Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields
From MaRDI portal
Publication:2819772
DOI10.1145/2755996.2756650zbMath1345.68293OpenAlexW2046635137MaRDI QIDQ2819772
Publication date: 29 September 2016
Published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2755996.2756650
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A quasi-linear irreducibility test in \(\mathbb{K}x[y\)] ⋮ Computing Riemann-Roch spaces via Puiseux expansions ⋮ Bivariate factorization using a critical fiber ⋮ Computing the equisingularity type of a pseudo-irreducible polynomial ⋮ On the extended Hensel construction and its application to the computation of real limit points ⋮ Computing Puiseux series: a fast divide and conquer algorithm
This page was built for publication: Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields
