Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference12 articles.
1. A. Barvinok, Computing the Ehrhart polynomial of a convex lattice polytope, Preprint, TRITA/MAT-92-0036, Royal Institute of Technology, Stockholm, 1992.
2. Proceedings of 34th Symposium on the Foundations of Computer Science (FOCS ’93);A. I. Barvinok,1993
3. W. Cook, M. Hartmann, R. Kannan, and C. McDiarmid, On integer points in polyhedra,Combinatorica 12 (1992), 27–37.
4. M. Dyer and A. M. Frieze, On the complexity of computing the volume of a polyhedron,SIAM J. Comput. 17(5) (1988), 967–974.
5. Annals of Mathematics Studies;W. Fulton,1993
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献