论文信息 - Chapter IV. Complexity of Polytope Volume Computation - 字舞流文

Chapter IV. Complexity of Polytope Volume Computation

We survey some recent results on the complexity of computing the vol ume of convex n-dimensional polytopes.

[1] J. Lawrence. Polytope volume computation , 1991 .

[2] L. Khachiyan,et al. On the conductance of order Markov chains , 1991 .

[3] Peter Winkler,et al. Counting linear extensions is #P-complete , 1991, STOC '91.

[4] György Elekes,et al. A geometric inequality and the complexity of computing volume , 1986, Discret. Comput. Geom..

[5] Zoltán Füredi,et al. Computing the volume is difficult , 1986, STOC '86.

[6] Richard P. Stanley,et al. Two poset polytopes , 1986, Discret. Comput. Geom..

[7] N. Linial. Hard enumeration problems in geometry and combinatorics , 1986 .

[8] Michael E. Saks,et al. Every poset has a good comparison , 1984, STOC '84.

[9] Michael L. Fredman,et al. How Good is the Information Theory Bound in Sorting? , 1976, Theor. Comput. Sci..

[10] Miklós Simonovits,et al. Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.