DNA-based computing of strategic assignment problems
DNA-based computing is a novel technique to tackle computationally difficult problems, in which computing time grows exponentially corresponding to problematic size. A strategic assignment problem is a typical nondeterministic polynomial problem, which is often associated with strategy applications....
| 主要な著者: | , , |
|---|---|
| その他の著者: | |
| フォーマット: | Journal Article |
| 言語: | English |
| 出版事項: |
2011
|
| 主題: | |
| オンライン･アクセス: | https://hdl.handle.net/10356/94052 http://hdl.handle.net/10220/7123 |
| 要約: | DNA-based computing is a novel technique to tackle computationally difficult problems, in which computing time grows exponentially corresponding to problematic size. A strategic assignment problem is a typical nondeterministic polynomial problem, which is often associated with strategy applications. In this Letter, a new approach dealing with strategic assignment problems is proposed based on manipulating DNA strands, which is believed to be better than the conventional silicon-based computing in solving the same problem. |
|---|