乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:15:35Z","timestamp":1725488135434},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667230"},{"type":"electronic","value":"9783540467960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46796-3_3","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:14:33Z","timestamp":1186053273000},"page":"19-28","source":"Crossref","is-referenced-by-count":6,"title":["Monomial Ideals and Planar Graphs"],"prefix":"10.1007","author":[{"given":"Ezra","family":"Miller","sequence":"first","affiliation":[]},{"given":"Bernd","family":"Sturmfels","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0022-4049(97)00002-9","volume":"117","author":"G. Agnarsson","year":"1997","unstructured":"G. Agnarsson. On the number of outside corners of monomial ideals, Journal of Pure and Applied Algebra, 117 (1997) 3\u201322.","journal-title":"Journal of Pure and Applied Algebra"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0012-365X(98)00309-4","volume":"201","author":"G. Agnarsson","year":"1999","unstructured":"G. Agnarsson, S. Felsner and W. Trotter. The maximum number of edges in a graph of bounded dimension, with applications to ring theory, Discrete Mathematics (201) (1999) 5\u201319","journal-title":"Discrete Mathematics"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.4310\/MRL.1998.v5.n1.a3","volume":"5","author":"D. Bayer","year":"1998","unstructured":"D. Bayer, I. Peeva and B. Sturmfels. Monomial resolutions, Mathematical Research Letters 5 (1998) 31\u201346.","journal-title":"Mathematical Research Letters"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0747-7171(92)90024-X","volume":"14","author":"D. Bayer","year":"1992","unstructured":"D. Bayer and M. Stillman. Computation of Hilbert functions, Journal of Symbolic Computation 14 (1992), 31\u201350.","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1515\/crll.1998.083","volume":"502","author":"D. Bayer","year":"1998","unstructured":"D. Bayer and B. Sturmfels. Cellular resolutions of monomial modules. Journal f\u00fcr die reine und angewandte Mathematik, 502 123\u2013140, 1998.","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01810852","volume":"2","author":"A. Bigatti","year":"1991","unstructured":"A. Bigatti, M. Caboara and L. Robbiano. On the computation of Hilbert-Poincar\u00e9 series. Appl. Algebra Engrg. Comm. Comput. 2 (1991), no. 1, 21\u201333.","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"3_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-09519-5_52","volume-title":"Proc. EUROSAM 79","author":"B. Buchberger","year":"1979","unstructured":"B. Buchberger, A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner bases, Proc. EUROSAM 79, Marseille, W. Ng (ed.), Lecture Notes in Computer Science, Vol. 72, Springer 1979, pp. 3\u201321."},{"key":"3_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-63163-1_4","volume-title":"Applied algebra, algebraic algorithms and error-correcting codes","author":"M. Caboara","year":"1997","unstructured":"M. Caboara, P. Conti and C. Traverso, Yet another ideal decomposition algorithm. Applied algebra, algebraic algorithms and error-correcting codes (Toulouse, 1997), Lecture Notes in Computer Science, Vol. 1255, Springer, 1997, pp. 39\u201354"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0022-4049(97)00007-8","volume":"117\/118","author":"A. Capani","year":"1997","unstructured":"A. Capani, G. de Dominicis, G. Niesi and L. Robbiano. Computing minimal finite free resolutions, Journal of Pure and Applied Algebra 117\/118 (1997), 105\u2013117.","journal-title":"Journal of Pure and Applied Algebra"},{"key":"3_CR10","volume-title":"Ideals, Varieties, and Algorithms","author":"D. Cox","year":"1997","unstructured":"D. Cox, J. Little and D. O\u2019Shea, Ideals, Varieties, and Algorithms, 2nd edition, Springer-Verlag, New York, 1997","edition":"2nd edition"},{"key":"3_CR11","volume-title":"Introduction to Commutative Algebra with a View towards Algebraic Geometry","author":"D. Eisenbud","year":"1995","unstructured":"D. Eisenbud. Introduction to Commutative Algebra with a View towards Algebraic Geometry, Springer Verlag, New York, 1995."},{"key":"3_CR12","unstructured":"V. Gasharov, I. Peeva and V. Welker, The lcm-lattice, preprint, 1998."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0012-365X(98)00315-X","volume":"201","author":"S. Hosten","year":"1999","unstructured":"S. Hosten and W. Morris Jr. The order dimension of the complete graph, Discrete Mathematics (201) (1999), 133\u2013139.","journal-title":"Discrete Mathematics"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jsco.1998.0221","volume":"26","author":"R. L. Scala","year":"1998","unstructured":"R. La Scala and M. Stillman. Strategies for computing minimal free resolutions, Journal of Symbolic Computation 26 (1998), no.4, 409\u2013431.","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR15","unstructured":"E. Miller. Alexander duality for monomial ideals and their resolutions, preprint, 1998, math.AG\/9812095."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0021-8693(86)90071-2","volume":"100","author":"H.M. M\u00f6ller","year":"1986","unstructured":"H.M. M\u00f6ller and F. Mora. New constructive methods in classical ideal theory, Journal of Algebra 100 (1986) 138\u2013178.","journal-title":"Journal of Algebra"},{"key":"3_CR17","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and Partially Ordered Sets. Dimension Theory","author":"W. Trotter","year":"1992","unstructured":"W. Trotter. Combinatorics and Partially Ordered Sets. Dimension Theory, The Johns Hopkins University Press, Baltimore, 1992."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"S. Yuzvinsky, Taylor and minimal resolutions of homogeneous polynomial ideals, preprint, 1999.","DOI":"10.4310\/MRL.1999.v6.n6.a14"},{"key":"3_CR19","volume-title":"Lectures on Polytopes","author":"G. Ziegler","year":"1994","unstructured":"G. Ziegler. Lectures on Polytopes, Springer Verlag, New York, 1994."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46796-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T17:10:40Z","timestamp":1683997840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46796-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667230","9783540467960"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-46796-3_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}