ログイン
Language:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 学術雑誌論文
  2. 4 自然科学

Worst and best irredundant sum-of-products expressions

http://hdl.handle.net/10228/615
http://hdl.handle.net/10228/615
6031ba37-ff11-469c-8931-c27e1b11dd71
名前 / ファイル ライセンス アクション
t0935.pdf t0935.pdf (346.5 kB)
アイテムタイプ 学術雑誌論文 = Journal Article(1)
公開日 2008-01-08
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
タイトル
タイトル Worst and best irredundant sum-of-products expressions
言語 en
言語
言語 eng
著者 笹尾, 勤

× 笹尾, 勤

WEKO 6598
Scopus著者ID 7006026413

en Sasao, Tsutomu

ja 笹尾, 勤

ja-Kana ササオ, ツトム


Search repository
Butler, J.T.

× Butler, J.T.

WEKO 1882

en Butler, J.T.

Search repository
抄録
内容記述タイプ Abstract
内容記述 In an irredundant sum-of-products expression (ISOP), each product is a prime implicant (Pl) and no product can be deleted without changing the function. Among the ISOPs for some function f, a worst ISOP (WSOP) is an ISOP with the largest number of Pls and a minimum ISOP (MSOP) is one with the smallest number. We show a class of functions for which the Minato-Morreale ISOP algorithm produces WSOPs. Since the ratio of the size of the WSOP to the size of the MSOP is arbitrarily large when it, the number of variables, is unbounded, the Minato-Morreale algorithm can produce results that are very far from minimum. We present a class of multiple-output functions whose WSOP size is also much larger than its MSOP size. For a set of benchmark functions, we show the distribution of ISOPs to the number of Pls. Among this set are functions where the MSOPs have almost as many Pls as do the WSOPs. These functions are known to be easy to minimize. Also, there are benchmark functions where the fraction of ISOPs that are MSOPs is small and MSOPs have many fewer Pls than the WSOPs. Such functions are known to be hard to minimize. For one class of functions, we show that the fraction of ISOPs that are MSOPs approaches 0 as n approaches infinity, suggesting that such functions are hard to minimize
書誌情報 IEEE Transactions on Computers

巻 50, 号 9, p. 935-948, 発行日 2001-09
出版社
出版者 Institute of Electrical and Electronics Engineers
DOI
関連タイプ isIdenticalTo
識別子タイプ DOI
関連識別子 info:doi/10.1109/12.954508
NAID
関連タイプ isIdenticalTo
識別子タイプ NAID
関連識別子 120002440794
NCID
収録物識別子タイプ NCID
収録物識別子 AA00667762
ISSN
収録物識別子タイプ PISSN
収録物識別子 0018-9340
著作権関連情報
権利情報 ©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
査読の有無
値 yes
情報源
識別子タイプ URI
関連識別子 DOI: 10.1109/12.954508
関連名称 DOI: 10.1109/12.954508
戻る
0
views
See details
Views

Versions

Ver.1 2023-05-15 14:12:03.927102
Show All versions

Share

Share
tweet

Cite as

Other

print

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX
  • ZIP

コミュニティ

確認

確認

確認


Powered by WEKO3


Powered by WEKO3