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)
|
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.
|