A simple and fast algorithm for computing the \(N\)-th term of a linearly recurrent sequence
From MaRDI portal
Publication:6538752
DOI10.1137/1.9781611976496.14MaRDI QIDQ6538752
Author name not available (Why is that?)
Publication date: 14 May 2024
No records found.
No records found.
This page was built for publication: A simple and fast algorithm for computing the \(N\)-th term of a linearly recurrent sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538752)
