Efficient computation of terms of linear recurrence sequences of any order

zbMath1459.11035arXiv1610.06376MaRDI QIDQ5384249

D. I. Khomovskii

Publication date: 21 June 2019

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

Mathematics Subject Classification ID

Recurrences (11B37) Calculation of integer sequences (11Y55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some primality tests that eluded Lucas
• Computing Fibonacci numbers (and similarly defined functions) in log time
• Program. construction. International summer school
• New cube root algorithm based on the third order linear recurrence relations in finite fields
• Public-key cryptosystems based on cubic finite field extensions
• Characterizing Pseudoprimes for Third-Order Linear Recurrences
• An Efficient Formula for Linear Recurrences
• An Algorithm for Evaluation of Remote Terms in A Linear Recurrence Sequence

This page was built for publication: Efficient computation of terms of linear recurrence sequences of any order