講演抄録/キーワード |
講演名 |
2008-11-06 09:55
Orthogonal Ray Graphs and Nano-PLA Design ○Anish Man Singh Shrestha・Satoshi Tayu・Shuichi Ueno(Tokyo Inst. of Tech) CAS2008-46 CST2008-24 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
The logic mapping problem and the problem of finding a largest square sub-crossbar with no defects in a defective nano-crossbar have been considered to be intractable in the literature. This paper shows that the former is indeed NP-hard, while the latter can be solved in polynomial time. |
キーワード |
(和) |
/ / / / / / / |
(英) |
Nano-PLA / NP-hard / Orthogonal Ray Graphs / Polynomial-Time Algorithm / / / / |
文献情報 |
信学技報, vol. 108, no. 277, CAS2008-46, pp. 5-10, 2008年11月. |
資料番号 |
CAS2008-46 |
発行日 |
2008-10-30 (CAS, CST) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
CAS2008-46 CST2008-24 |
|