Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field

DOI10.1145/2930889.2930904zbMath1364.12009arXiv1602.00545OpenAlexW3106267074MaRDI QIDQ2985816

Alin Bostan, Gilles Christol, Philippe Dumas

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.00545

zbMATH Keywords

diagonalsfinite fieldsalgebraic complexityalgebraic seriesMahler equations\(p\)-rational seriessection operators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Calculation of integer sequences (11Y55)

Related Items (2)

Fast coefficient computation for algebraic power series in positive characteristic ⋮ Unnamed Item

This page was built for publication: Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field