22 citations · 108 across the 38 of their papers we have counts for
1 paper · 2 filters
Thomas Seiller, Luc Pellissier, Ulysse Léchine
This paper presents a new abstract method for proving lower bounds in computational complexity. Based on the notion of topological and measurable entropy for dynamical systems, it…