Research on Algorithms for Random Generation of Discrete Objects
| Project/Area Number |
20740056
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
KIJIMA Shuji Kyoto University, システム情報科学研究院, 准教授 (70452307)
|
|---|
| Project Period (FY) |
2008 – 2010
|
| Project Status |
Completed (Fiscal Year 2010)
|
| Budget Amount *help |
¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Fiscal Year 2010: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2009: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2008: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Keywords | 応用数学 / アルゴリズム / 確率論 / マルコフ連鎖 / グラフ論 / 離散数学 / 乱択アルゴリズム / マルコフ連鎖モンテカルロ法 / 列挙 / コーダルグラフ / 分配束 |
|---|
| Research Abstract |
This research is concerned with algorithms for random sampling of combinatorial objects. From a computational complexity theoretical viewpoint, this research tries to figure out whether polynomial time algorithms exist for several objects. For chorda graph sandwiches, queuing networks, ideals of partially ordered sets, Tutte polynomials etc, we obtained some computational complexity results on polynomial time algorithms and impossibility.
|
Report
(4 results)
Research Products
(36 results)
