Author:
De Loera Jesús A.,Hemmecke Raymond,Köppe Matthias,Weismantel Robert
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference20 articles.
1. Barvinok A.I. (1994). Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19: 769–779
2. Barvinok, A.I., Pommersheim, J.E.: An algorithmic theory of lattice points in polyhedra. New Perspectives in Algebraic Combinatorics, Math. Sci. Res. Inst. Publ., vol. 38. Cambridge University Press, Cambridge, pp. 91–147 (1999)
3. Bellare, M., Rogaway, P.: The complexity of aproximating a nonlinear program. In: Pardalos [15]
4. Cox D.A., Little J.B., O’Shea D. (1992). Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, Berlin
5. de Klerk E., Laurent M., Parrilo P.A. (2006). A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoret. Comput. Sci. 361: 210–225
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献