14 citations · 39 across the 17 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 7 cited
On the complexity of the chip-firing reachability problem
Bálint Hujter, Viktor Kiss, Lilla Tóthmérész
In this paper, we study the complexity of the chip-firing reachability problem. We show that for Eulerian digraphs, the reachability problem can be decided in strongly polynomial t…
math.LO2015★ 1 cited
Classification of bounded Baire class functions
Viktor Kiss
Kechris and Louveau showed that each real-valued bounded Baire class 1 function defined on a compact metric space can be written as an alternating sum of a decreasing countable tra…