English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this article, we study the problem of enumerating the models of DNFformulas. The aim is to provide enumeration algorithms with a delay thatdepends polynomially on the size of each model and not on the size of theformula, which can be exponentially larger. We succeed for two subclasses ofDNF formulas: we provide a constant delay algorithm for $k$-DNF with fixed $k$by an appropriate amortization method and we give a quadratic delay algorithmfor monotone formulas. We then focus on the \emph{average delay} of enumerationalgorithms and show how to obtain a sublinear delay in the formula size.

Enumerating models of DNF faster: breaking the dependency on the formula size