@article{oai:muroran-it.repo.nii.ac.jp:00010265,
 author = {SHRESTHA, Anish Man Singh and 髙岡, 旭 and TAKAOKA, Asahi and TAYU, Satoshi and 田湯, 智 and UENO, Shuichi and 上野, 修一},
 issue = {1},
 journal = {IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS},
 month = {},
 note = {application/pdf, The logic mapping problem and the problem of finding a largest sub-crossbar with no defects in a nano-crossbar with nonprogrammable-crosspoint defects and disconnected-wire defects are known to be NP-hard. This paper shows that for nano-crossbars with only disconnected-wire defects, the former remains NP-hard, while the latter can be solved in polynomial time.},
 pages = {35--41},
 title = {On Two Problems of Nano-PLA Design},
 volume = {E94D},
 year = {2011},
 yomi = {タカオカ, アサヒ and タユ, サトシ and ウエノ, シュウイチ}
}