no code implementations • 1 May 2022 • Nadia Creignou, Arnaud Durand, Heribert Vollmer
We refine the complexity landscape for enumeration problems by introducing very low classes defined by using Boolean circuits as enumerators.
no code implementations • 25 Apr 2014 • Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
This paper presents a general approach to define new merging operators derived from existing ones such that the result of merging remains in the fragment under consideration.
