2010 Fiscal Year Final Research Report
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
|
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.
|
Research Products
(16 results)