乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T13:24:12Z","timestamp":1719926652337},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1016\/j.jsc.2016.12.005","type":"journal-article","created":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T03:46:29Z","timestamp":1483587989000},"page":"97-118","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["A modular algorithm to compute the generalized Hermite normal form for Z<\/mml:mi>[<\/mml:mo>x<\/mml:mi>]<\/mml:mo><\/mml:math>-lattices"],"prefix":"10.1016","volume":"81","author":[{"given":"Rui-Juan","family":"Jing","sequence":"first","affiliation":[]},{"given":"Chun-Ming","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.jsc.2016.12.005_br0010","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0747-7171(02)00140-2","article-title":"Modular algorithms for computing Gr\u00f6bner bases","volume":"35","author":"Arnold","year":"2003","journal-title":"J. Symb. Comput."},{"issue":"6","key":"10.1016\/j.jsc.2016.12.005_br0030","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1016\/j.jsc.2006.02.001","article-title":"Normal forms for general polynomial matrices","volume":"41","author":"Beckermann","year":"2006","journal-title":"J. Symb. Comput."},{"issue":"3","key":"10.1016\/j.jsc.2016.12.005_br0040","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0885-064X(86)90001-4","article-title":"Polynomial division and its computational complexity","volume":"2","author":"Bini","year":"1986","journal-title":"J. Complex."},{"key":"10.1016\/j.jsc.2016.12.005_br0050","series-title":"Algebraic Complexity Theory","author":"B\u00fcrgisser","year":"1996"},{"key":"10.1016\/j.jsc.2016.12.005_br0060","series-title":"A Course in Computational Algebraic Number Theory","volume":"vol. 138","author":"Cohen","year":"1983"},{"key":"10.1016\/j.jsc.2016.12.005_br0070","series-title":"Using Algebraic Geometry","volume":"vol. 185","author":"Cox","year":"2005"},{"key":"10.1016\/j.jsc.2016.12.005_br0080","series-title":"Toric Varieties","author":"Cox","year":"2010"},{"issue":"1","key":"10.1016\/j.jsc.2016.12.005_br0090","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/moor.12.1.50","article-title":"Hermite normal form computation using modulo determinant arithmetic","volume":"12","author":"Domich","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.jsc.2016.12.005_br0100","author":"Gao"},{"key":"10.1016\/j.jsc.2016.12.005_br0110","author":"Jing"},{"issue":"4","key":"10.1016\/j.jsc.2016.12.005_br0120","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1137\/0608057","article-title":"Fast parallel computation of Hermite and Smith forms of polynomial matrices","volume":"8","author":"Kaltofen","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"10.1016\/j.jsc.2016.12.005_br0130","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0747-7171(88)80020-8","article-title":"Computing a Gr\u00f6bner basis of a polynomial ideal over a Euclidean domain","volume":"6","author":"Kandri-Rody","year":"1988","journal-title":"J. Symb. Comput."},{"issue":"4","key":"10.1016\/j.jsc.2016.12.005_br0140","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","article-title":"Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix","volume":"8","author":"Kannan","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jsc.2016.12.005_br0160","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0747-7171(85)80035-3","article-title":"Ideal bases and primary decomposition: case of two variables","volume":"3","author":"Lazard","year":"1985","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2016.12.005_br0150","series-title":"Proc. STOC'90","first-page":"564","article-title":"The number field sieve","author":"Lenstra","year":"1990"},{"key":"10.1016\/j.jsc.2016.12.005_br0170","series-title":"Revisiting Strong Gr\u00f6bner Bases over Euclidean Domains","author":"Lichtblau","year":"2003"},{"key":"10.1016\/j.jsc.2016.12.005_br0180","series-title":"Proc. STOC'73","first-page":"142","article-title":"Fast computation of GCDs","author":"Moenck","year":"1973"},{"issue":"4","key":"10.1016\/j.jsc.2016.12.005_br0190","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0747-7171(02)00139-6","article-title":"On lattice reduction for polynomial matrices","volume":"35","author":"Mulders","year":"2003","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2016.12.005_br0200","series-title":"Algorithms for Matrix Canonical Forms","author":"Storjohann","year":"2000"},{"key":"10.1016\/j.jsc.2016.12.005_br0210","series-title":"Proc. ISSAC1996","first-page":"259","article-title":"Asymptotically fast computation of Hermite normal forms of integer matrices","author":"Storjohann","year":"1996"},{"issue":"2","key":"10.1016\/j.jsc.2016.12.005_br0220","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0747-7171(88)80049-X","article-title":"A p-adic approach to the computation of Gr\u00f6bner bases","volume":"6","author":"Winkler","year":"1988","journal-title":"J. Symb. Comput."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717116301699?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717116301699?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T07:41:37Z","timestamp":1625125297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717116301699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":21,"alternative-id":["S0747717116301699"],"URL":"https:\/\/doi.org\/10.1016\/j.jsc.2016.12.005","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A modular algorithm to compute the generalized Hermite normal form for -lattices","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jsc.2016.12.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}