ライブラリ登録: Guest
Journal of Automation and Information Sciences

年間 12 号発行

ISSN 印刷: 1064-2315

ISSN オンライン: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Principles of Designing PDC Algorithms for Intractable Combinatorial Problems

巻 29, 発行 2-3, 1997, pp. 36-40
DOI: 10.1615/JAutomatInfScien.v29.i2-3.70
Get accessGet access

要約

A new approach to constructing efficient exact algorithms for hard combinatorial problems is suggested. Concepts of a PDC problem and a PDC algorithm (algorithm that contains both polynomial and decompositional components) are introduced.

Begell Digital Portal Begellデジタルライブラリー 電子書籍 ジャーナル 参考文献と会報 リサーチ集 価格及び購読のポリシー Begell House 連絡先 Language English 中文 Русский Português German French Spain