Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Michael Vyalyi

Michael Vyalyi

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Complexity×1

Frequent co-authors

Artem Parfenov1×

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

Papers

cs.CCRecentMay 31, 2026

On the Complexity of Recurrence Evaluation

Artem Parfenov, Michael Vyalyi

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…

View →