On the complexity of recurring sequences

DOI10.1515/156939203322109122zbMath1051.03031OpenAlexW2027190454MaRDI QIDQ4809616

Sergey S. Marchenkov

Publication date: 30 August 2004

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/156939203322109122

zbMATH Keywords

complexityrecurring sequencebraching

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (2)

On polynomial-modular recursive sequences ⋮ On the complexity of polynomial recurrence sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of recurring sequences