direct access 1functional dependencies 1information-theoretic bounds 1join queries 1preprocessing complexity 1
From the 1 of 5 linked papers with an AI index.
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2024
From Amortized to Worst Case Delay in Enumeration Algorithms
Florent Capelli, Yann Strozecki
The quality of enumeration algorithms is often measured by their delay, that is, the maximal time spent between the output of two distinct solutions. If the goal is to enumerate $t…
cs.CC2024
Enumerating models of DNF faster: breaking the dependency on the formula size
Florent Capelli, Yann Strozecki
In this article, we study the problem of enumerating the models of DNF formulas. The aim is to provide enumeration algorithms with a delay that depends polynomially on the size of…