Enumerating models of DNF faster: breaking the dependency on the formula size
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 each model and not on the size of the formula, which can be exponentially larger. We succeed for two subclasses of DNF f...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2024-08 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Capelli, Florent Strozecki, Yann |
| description | 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 each model and not on the size of the formula, which can be exponentially larger. We succeed for two subclasses of DNF formulas: we provide a constant delay algorithm for \(k\)-DNF with fixed \(k\) by an appropriate amortization method and we give a quadratic delay algorithm for monotone formulas. We then focus on the \emph{average delay} of enumeration algorithms and show how to obtain a sublinear delay in the formula size. |
| doi_str_mv | 10.48550/arxiv.1810.04006 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1810_04006</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2117616888</sourcerecordid><originalsourceid>FETCH-LOGICAL-a956-89b3ba0f0b411a8adbdcd8e8c79d163ff0cb1f711dfc5cb42073963d71f8ece63</originalsourceid><addsrcrecordid>eNotj8tOwzAURC0kJKrSD2CFJdYpvnbiOOxQaQGpwKb7yI9rSGke2AmifD1py2qkmdFoDiFXwOapyjJ2q8NP9T0HNRosZUyekQkXAhKVcn5BZjFuGWNc5jzLxIS8LJuhxqD7qnmndetwF2nr6cPrinodewx31ATUn4e4_0DqsMPGYWP3tG2Ojm9DPew0jdUvXpJzr3cRZ_86JZvVcrN4StZvj8-L-3Wii0wmqjDCaOaZSQG00s446xQqmxcOpPCeWQM-B3DeZtaknOWikMLl4BValGJKrk-zR9ayC1Wtw748MJdH5rFxc2p0of0aMPblth1CM34qOUAuQSqlxB8mZloI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2117616888</pqid></control><display><type>article</type><title>Enumerating models of DNF faster: breaking the dependency on the formula size</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Capelli, Florent ; Strozecki, Yann</creator><creatorcontrib>Capelli, Florent ; Strozecki, Yann</creatorcontrib><description>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 each model and not on the size of the formula, which can be exponentially larger. We succeed for two subclasses of DNF formulas: we provide a constant delay algorithm for \(k\)-DNF with fixed \(k\) by an appropriate amortization method and we give a quadratic delay algorithm for monotone formulas. We then focus on the \emph{average delay} of enumeration algorithms and show how to obtain a sublinear delay in the formula size.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1810.04006</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Computer Science - Computational Complexity ; Computer Science - Data Structures and Algorithms ; Delay ; Dependence ; Enumeration ; Mathematical models ; Polynomials</subject><ispartof>arXiv.org, 2024-08</ispartof><rights>2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.1016/j.dam.2020.02.014$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1810.04006$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Capelli, Florent</creatorcontrib><creatorcontrib>Strozecki, Yann</creatorcontrib><title>Enumerating models of DNF faster: breaking the dependency on the formula size</title><title>arXiv.org</title><description>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 each model and not on the size of the formula, which can be exponentially larger. We succeed for two subclasses of DNF formulas: we provide a constant delay algorithm for \(k\)-DNF with fixed \(k\) by an appropriate amortization method and we give a quadratic delay algorithm for monotone formulas. We then focus on the \emph{average delay} of enumeration algorithms and show how to obtain a sublinear delay in the formula size.</description><subject>Algorithms</subject><subject>Computer Science - Computational Complexity</subject><subject>Computer Science - Data Structures and Algorithms</subject><subject>Delay</subject><subject>Dependence</subject><subject>Enumeration</subject><subject>Mathematical models</subject><subject>Polynomials</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj8tOwzAURC0kJKrSD2CFJdYpvnbiOOxQaQGpwKb7yI9rSGke2AmifD1py2qkmdFoDiFXwOapyjJ2q8NP9T0HNRosZUyekQkXAhKVcn5BZjFuGWNc5jzLxIS8LJuhxqD7qnmndetwF2nr6cPrinodewx31ATUn4e4_0DqsMPGYWP3tG2Ojm9DPew0jdUvXpJzr3cRZ_86JZvVcrN4StZvj8-L-3Wii0wmqjDCaOaZSQG00s446xQqmxcOpPCeWQM-B3DeZtaknOWikMLl4BValGJKrk-zR9ayC1Wtw748MJdH5rFxc2p0of0aMPblth1CM34qOUAuQSqlxB8mZloI</recordid><startdate>20240826</startdate><enddate>20240826</enddate><creator>Capelli, Florent</creator><creator>Strozecki, Yann</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20240826</creationdate><title>Enumerating models of DNF faster: breaking the dependency on the formula size</title><author>Capelli, Florent ; Strozecki, Yann</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a956-89b3ba0f0b411a8adbdcd8e8c79d163ff0cb1f711dfc5cb42073963d71f8ece63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Computer Science - Computational Complexity</topic><topic>Computer Science - Data Structures and Algorithms</topic><topic>Delay</topic><topic>Dependence</topic><topic>Enumeration</topic><topic>Mathematical models</topic><topic>Polynomials</topic><toplevel>online_resources</toplevel><creatorcontrib>Capelli, Florent</creatorcontrib><creatorcontrib>Strozecki, Yann</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Capelli, Florent</au><au>Strozecki, Yann</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Enumerating models of DNF faster: breaking the dependency on the formula size</atitle><jtitle>arXiv.org</jtitle><date>2024-08-26</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>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 each model and not on the size of the formula, which can be exponentially larger. We succeed for two subclasses of DNF formulas: we provide a constant delay algorithm for \(k\)-DNF with fixed \(k\) by an appropriate amortization method and we give a quadratic delay algorithm for monotone formulas. We then focus on the \emph{average delay} of enumeration algorithms and show how to obtain a sublinear delay in the formula size.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1810.04006</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2024-08 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1810_04006 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms Delay Dependence Enumeration Mathematical models Polynomials |
| title | Enumerating models of DNF faster: breaking the dependency on the formula size |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T02%3A28%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Enumerating%20models%20of%20DNF%20faster:%20breaking%20the%20dependency%20on%20the%20formula%20size&rft.jtitle=arXiv.org&rft.au=Capelli,%20Florent&rft.date=2024-08-26&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1810.04006&rft_dat=%3Cproquest_arxiv%3E2117616888%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2117616888&rft_id=info:pmid/&rfr_iscdi=true |