Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation (Q1690783): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:35, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation |
scientific article |
Statements
Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation (English)
0 references
12 January 2018
0 references
nested recursion
0 references
recurrences
0 references
quasipolynomials
0 references
integer sequences
0 references
