12 citations · 48 across the 12 of their papers we have counts for
Showing 2017 · cs.CCShow all
2 papers · 2 filters
cs.CC2017★ 10 cited
Efficient enumeration of solutions produced by closure operations
Arnaud Mary, Yann Strozecki
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…
cs.CC2017★ 2 cited
On The Complexity of Enumeration
Florent Capelli, Yann Strozecki
We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial del…