2 papers
cs.CC2026
On the Complexity of Recurrence Evaluation
Artem Parfenov, Michael Vyalyi
In this paper, we study the complexity of the recurrence evaluation problem. We are interested in finitely valued recurrent functions. We present two results in this direction. Fir…
math.CO2025
Avoidability beyond paths
Vladimir Gurvich, Matjaž Krnc, Martin MilaniÄ +1
The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, MilaniÄ, and Servatius in 2019 as a common generalization of avoidable vertices and simpl…