On the complexity of minimizing the OBDD size for incompletely specified functions
The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e.g., the verification of sequential machines and the construction of OBDD's for incompletely specified circuits. The complexity of this pro...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computer-aided design of integrated circuits and systems 1996-11, Vol.15 (11), p.1435-1437 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1437 |
|---|---|
| container_issue | 11 |
| container_start_page | 1435 |
| container_title | IEEE transactions on computer-aided design of integrated circuits and systems |
| container_volume | 15 |
| creator | Sauerhoff, M. Wegener, I. |
| description | The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e.g., the verification of sequential machines and the construction of OBDD's for incompletely specified circuits. The complexity of this problem is determined. The decision problem is NP-complete. Efficient approximation algorithms exist only if NP=P. |
| doi_str_mv | 10.1109/43.543775 |
| format | Article |
| fullrecord | <record><control><sourceid>pascalfrancis_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_2496223</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>543775</ieee_id><sourcerecordid>2496223</sourcerecordid><originalsourceid>FETCH-LOGICAL-c370t-1112974414a8a5e62244dbd24ef2c21613beededce0b56632187b084854d62703</originalsourceid><addsrcrecordid>eNo9kD1PwzAYhC0EEqUwsDJ5YGFI8euPOBmh5UuqFAnBHDnOazBKnCgOEu2vp5Cq0w333J10hFwCWwCw_FaKhZJCa3VEZpALnUhQcExmjOssYUyzU3IW4xdjIBXPZ-S1CHT8RGq7tm_wx48b2jna-uBbv_Xh498s7lcrGv0WqesG6sMEj9hsaOzReuexpu472NF3IZ6TE2eaiBd7nZP3x4e35XOyLp5elnfrxArNxgQAeK6lBGkyozDlXMq6qrlExy2HFESFWGNtkVUqTQWHTFcsk5mSdco1E3NyM_XaoYtxQFf2g2_NsCmBlX9nlFKU0xk79npiexOtadxggvXxEOAy3-2LHXY1YR4RD-6-4xeRwmXk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the complexity of minimizing the OBDD size for incompletely specified functions</title><source>IEEE Electronic Library (IEL)</source><creator>Sauerhoff, M. ; Wegener, I.</creator><creatorcontrib>Sauerhoff, M. ; Wegener, I.</creatorcontrib><description>The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e.g., the verification of sequential machines and the construction of OBDD's for incompletely specified circuits. The complexity of this problem is determined. The decision problem is NP-complete. Efficient approximation algorithms exist only if NP=P.</description><identifier>ISSN: 0278-0070</identifier><identifier>EISSN: 1937-4151</identifier><identifier>DOI: 10.1109/43.543775</identifier><identifier>CODEN: ITCSDI</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Approximation algorithms ; Automata ; Binary decision diagrams ; Boolean functions ; Circuits ; Data structures ; Design. Technologies. Operation analysis. Testing ; Electronics ; Exact sciences and technology ; Heuristic algorithms ; Integrated circuits ; Minimization ; Polynomials ; Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices</subject><ispartof>IEEE transactions on computer-aided design of integrated circuits and systems, 1996-11, Vol.15 (11), p.1435-1437</ispartof><rights>1997 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c370t-1112974414a8a5e62244dbd24ef2c21613beededce0b56632187b084854d62703</citedby><cites>FETCH-LOGICAL-c370t-1112974414a8a5e62244dbd24ef2c21613beededce0b56632187b084854d62703</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/543775$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/543775$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2496223$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Sauerhoff, M.</creatorcontrib><creatorcontrib>Wegener, I.</creatorcontrib><title>On the complexity of minimizing the OBDD size for incompletely specified functions</title><title>IEEE transactions on computer-aided design of integrated circuits and systems</title><addtitle>TCAD</addtitle><description>The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e.g., the verification of sequential machines and the construction of OBDD's for incompletely specified circuits. The complexity of this problem is determined. The decision problem is NP-complete. Efficient approximation algorithms exist only if NP=P.</description><subject>Applied sciences</subject><subject>Approximation algorithms</subject><subject>Automata</subject><subject>Binary decision diagrams</subject><subject>Boolean functions</subject><subject>Circuits</subject><subject>Data structures</subject><subject>Design. Technologies. Operation analysis. Testing</subject><subject>Electronics</subject><subject>Exact sciences and technology</subject><subject>Heuristic algorithms</subject><subject>Integrated circuits</subject><subject>Minimization</subject><subject>Polynomials</subject><subject>Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices</subject><issn>0278-0070</issn><issn>1937-4151</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><recordid>eNo9kD1PwzAYhC0EEqUwsDJ5YGFI8euPOBmh5UuqFAnBHDnOazBKnCgOEu2vp5Cq0w333J10hFwCWwCw_FaKhZJCa3VEZpALnUhQcExmjOssYUyzU3IW4xdjIBXPZ-S1CHT8RGq7tm_wx48b2jna-uBbv_Xh498s7lcrGv0WqesG6sMEj9hsaOzReuexpu472NF3IZ6TE2eaiBd7nZP3x4e35XOyLp5elnfrxArNxgQAeK6lBGkyozDlXMq6qrlExy2HFESFWGNtkVUqTQWHTFcsk5mSdco1E3NyM_XaoYtxQFf2g2_NsCmBlX9nlFKU0xk79npiexOtadxggvXxEOAy3-2LHXY1YR4RD-6-4xeRwmXk</recordid><startdate>19961101</startdate><enddate>19961101</enddate><creator>Sauerhoff, M.</creator><creator>Wegener, I.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19961101</creationdate><title>On the complexity of minimizing the OBDD size for incompletely specified functions</title><author>Sauerhoff, M. ; Wegener, I.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c370t-1112974414a8a5e62244dbd24ef2c21613beededce0b56632187b084854d62703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Applied sciences</topic><topic>Approximation algorithms</topic><topic>Automata</topic><topic>Binary decision diagrams</topic><topic>Boolean functions</topic><topic>Circuits</topic><topic>Data structures</topic><topic>Design. Technologies. Operation analysis. Testing</topic><topic>Electronics</topic><topic>Exact sciences and technology</topic><topic>Heuristic algorithms</topic><topic>Integrated circuits</topic><topic>Minimization</topic><topic>Polynomials</topic><topic>Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sauerhoff, M.</creatorcontrib><creatorcontrib>Wegener, I.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>IEEE transactions on computer-aided design of integrated circuits and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sauerhoff, M.</au><au>Wegener, I.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the complexity of minimizing the OBDD size for incompletely specified functions</atitle><jtitle>IEEE transactions on computer-aided design of integrated circuits and systems</jtitle><stitle>TCAD</stitle><date>1996-11-01</date><risdate>1996</risdate><volume>15</volume><issue>11</issue><spage>1435</spage><epage>1437</epage><pages>1435-1437</pages><issn>0278-0070</issn><eissn>1937-4151</eissn><coden>ITCSDI</coden><abstract>The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e.g., the verification of sequential machines and the construction of OBDD's for incompletely specified circuits. The complexity of this problem is determined. The decision problem is NP-complete. Efficient approximation algorithms exist only if NP=P.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/43.543775</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0278-0070 |
| ispartof | IEEE transactions on computer-aided design of integrated circuits and systems, 1996-11, Vol.15 (11), p.1435-1437 |
| issn | 0278-0070 1937-4151 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_2496223 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Approximation algorithms Automata Binary decision diagrams Boolean functions Circuits Data structures Design. Technologies. Operation analysis. Testing Electronics Exact sciences and technology Heuristic algorithms Integrated circuits Minimization Polynomials Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices |
| title | On the complexity of minimizing the OBDD size for incompletely specified functions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T10%3A16%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20complexity%20of%20minimizing%20the%20OBDD%20size%20for%20incompletely%20specified%20functions&rft.jtitle=IEEE%20transactions%20on%20computer-aided%20design%20of%20integrated%20circuits%20and%20systems&rft.au=Sauerhoff,%20M.&rft.date=1996-11-01&rft.volume=15&rft.issue=11&rft.spage=1435&rft.epage=1437&rft.pages=1435-1437&rft.issn=0278-0070&rft.eissn=1937-4151&rft.coden=ITCSDI&rft_id=info:doi/10.1109/43.543775&rft_dat=%3Cpascalfrancis_RIE%3E2496223%3C/pascalfrancis_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=543775&rfr_iscdi=true |