A Study on FixedParameter Algorithms and Property Testing
博士 === 國立中正大學 === 資訊工程研究所 === 99 === For a long time, as long as a problem is proved to be {\bf NP}-hard, people usually avoid solving it exactly due to its computational hardness. In fact, there are strategies of designing {\em fixed-parameter algorithms}, which can be used to solve these problems...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/71313019785581287693 |