2013 Fiscal Year Final Research Report
Proposing new sapmling algorithms
| Project/Area Number |
23700025
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Seikei University (2012-2013)
Kwansei Gakuin University (2011) |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Keywords | サンプリングアルゴリズム / マルコフ連鎖モンテカルロ法 / 近似数え上げ |
|---|
| Research Abstract |
There are two main outcomes in this research project. We prove that, 1: counting paths and cycles are #P-hard (i.e., it is hard to exactly compute the numbers.), 2: they are inapproximable (under RP is not NP). Since the structure of a path and a cycle is close to that of a tree, we hope that our results give some insights into approximately counting trees which is a subproblem of approximately computing Tutte polynomials.
|
