Artem Parfenov
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1
Frequent co-authors
Research Timeline
2026
On the Complexity of Recurrence Evaluation
This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence relation.
Highlighted terms show continued research focus across papers