<学術雑誌論文>
NP-complete Problems on Label Updating Calculation in ATMS

作成者
本文言語
出版者
発行日
雑誌名
開始ページ
終了ページ
出版タイプ
アクセス権
概要 We investigate the computational complexity of the label updating calculation in ATMS and show that the following two decision problems are NP-complete. (1) The problem of deciding whether there exist...s a consistent environment calculated from a new justification for a node. (2) The problem of deciding whether there exists an environment calculated from a new justification for a node such that it is not a superset of any environment in the label of the node.続きを見る

本文情報を非表示

rifis-tr-39 pdf 421 KB 46 RIFIS Technical Report
p001 pdf 298 KB 34 Bulletin of Informatics and Cybernetics

詳細

レコードID
査読有無
関連情報
ISSN
NCID
登録日 2009.04.22
更新日 2017.01.20