Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation (Q1690783): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962702767 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.06342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Recurrence Relations with Conolly-like Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasipolynomial Solutions to the Hofstadter Q-Recurrence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing New Families of Nested Recursions with Slow Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees and meta-Fibonacci sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conway's Challenge Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3087635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-behaved cousin of the Hofstadter sequence / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:44, 14 July 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
    0 references
    12 January 2018
    0 references
    nested recursion
    0 references
    recurrences
    0 references
    quasipolynomials
    0 references
    integer sequences
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references