Effective divergence analysis for linear recurrence sequences
We study the growth behaviour of rational linear recurrence sequences. We show that for loworder sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational linear recurrence sequence and computes effective fine-grained...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference item |
| Published: |
Schloss Dagstuhl
2018
|