{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:19:00Z","timestamp":1759331940438,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2012,1,23]],"date-time":"2012-01-23T00:00:00Z","timestamp":1327276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2012,1,23]]},"abstract":"We are interested in quickly computing the exact value of integrals of polynomial functions over domains that are decomposable into convex polyhedra (e.g., a tetrahedral or cubical mesh decomposition of space). We describe a software implementation, part of the software LattE, and provide benchmark computations.<\/jats:p>","DOI":"10.1145\/2110170.2110175","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T14:49:20Z","timestamp":1328021360000},"page":"169-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Software for exact integration of polynomials over polyhedra"],"prefix":"10.1145","volume":"45","author":[{"given":"J. A.","family":"De Loera","sequence":"first","affiliation":[{"name":"University of California, Davis, CA"}]},{"given":"B.","family":"Dutra","sequence":"additional","affiliation":[{"name":"University of California, Davis, CA"}]},{"given":"M.","family":"K\u00f6ppe","sequence":"additional","affiliation":[{"name":"University of California, Davis, CA"}]},{"given":"S.","family":"Moreinis","sequence":"additional","affiliation":[{"name":"University of California, Davis, CA"}]},{"given":"G.","family":"Pinto","sequence":"additional","affiliation":[]},{"given":"J.","family":"Wu","sequence":"additional","affiliation":[]}],"member":"320","published-online":{"date-parts":[[2012,1,23]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1090\/S0025-5718-2010-02378-6"},{"key":"e_1_2_1_2_1","first-page":"149","article-title":"Computation of exponential integrals. Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) Teor","volume":"5","author":"Barvinok Alexander I.","year":"1991","journal-title":"Slozhn. Vychisl."},{"key":"e_1_2_1_3_1","first-page":"1","article-title":"Partition functions in optimization and computational problems. Algebra i Analiz, 4:3--53, 1992. translation","volume":"4","author":"Barvinok Alexander I.","year":"1993","journal-title":"St. Petersburg Math. J."},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1007\/s00283-008-9013-y"},{"issue":"4","key":"e_1_2_1_5_1","first-page":"653","article-title":"Points entiers dans les poly\u00e0dres convexes. Ann. Sci. \u00c9cole Norm","volume":"21","author":"Brion Michel","year":"1988","journal-title":"Sup."},{"doi-asserted-by":"crossref","unstructured":"Benno\n \n B\u00fceler Andreas\n \n Enge and \n \n \n Komei\n \n Fukuda\n .\n \n \n \n Exact\n volume computation for polytopes: A practical study. In Gil Kalai and G\u00fcnter M. Ziegler editors Polytopes -- Combinatorics and Computation volume \n 29\n of \n DMV-Seminars Basel 2000\n . \n Birkh\u00e4user Verlag\n . http:\/\/www.math.u-bordeaux1.fr\/~enge\/index.php. Benno B\u00fceler Andreas Enge and Komei Fukuda. Exact volume computation for polytopes: A practical study. In Gil Kalai and G\u00fcnter M. Ziegler editors Polytopes -- Combinatorics and Computation volume 29 of DMV-Seminars Basel 2000. Birkh\u00e4user Verlag. http:\/\/www.math.u-bordeaux1.fr\/~enge\/index.php.","key":"e_1_2_1_6_1","DOI":"10.1007\/978-3-0348-8438-9_6"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1016\/j.jsc.2003.04.003"},{"key":"e_1_2_1_8_1","first-page":"94","article-title":"On the complexity of some basic problems in computational convexity: II. Volume and mixed volumes. Universit\u00e4t Trier, Mathematik\/Informatik","author":"Gritzmann Peter","year":"1994","journal-title":"Forschungsbericht"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1137\/060664768"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1007\/11832225_28"},{"doi-asserted-by":"publisher","key":"e_1_2_1_11_1","DOI":"10.1090\/S0025-5718-1991-1079024-2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1007\/s00355-007-0236-1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1016\/S0965-9978(03)00030-9"},{"unstructured":"G\u00fcnter Ziegler. Database of 0--1 polytopes. http:\/\/www.math.tu-berlin.de\/polymake\/examples\/. Accessed: 04\/13\/2011. G\u00fcnter Ziegler. Database of 0--1 polytopes. http:\/\/www.math.tu-berlin.de\/polymake\/examples\/. Accessed: 04\/13\/2011.","key":"e_1_2_1_14_1"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2110170.2110175","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2110170.2110175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:39Z","timestamp":1750249419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2110170.2110175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,23]]},"references-count":14,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2012,1,23]]}},"alternative-id":["10.1145\/2110170.2110175"],"URL":"https:\/\/doi.org\/10.1145\/2110170.2110175","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2012,1,23]]},"assertion":[{"value":"2012-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}