{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:30:52Z","timestamp":1773235852873,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540878261","type":"print"},{"value":"9783540878278","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87827-8_8","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T13:53:21Z","timestamp":1221918801000},"page":"97-107","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Algorithms for Computing N\u0153ther Normalization"],"prefix":"10.1007","author":[{"given":"Amir","family":"Hashemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Arnold, E.A.: Computing Gr\u00f6bner Bases with Hilbert Lucky Primes. PhD thesis, University of Maryland (2000)"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0747-7171(02)00140-2","volume":"35","author":"E.A. Arnold","year":"2003","unstructured":"Arnold, E.A.: Modular algorithms for computing Gr\u00f6bner bases. J. Symbolic Comput.\u00a035(4), 403\u2013419 (2003)","journal-title":"J. Symbolic Comput."},{"key":"8_CR3","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s: Applications aux codes correcteurs et \u00e0 la cryptographie. PhD thesis, Universit\u00e9 Paris6 (2004)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0747-7171(92)90024-X","volume":"14","author":"D. Bayer","year":"1992","unstructured":"Bayer, D., Stillman, M.: Computation of Hilbert functions. J. Symbolic Comput.\u00a014(1), 31\u201350 (1992)","journal-title":"J. Symbolic Comput."},{"key":"8_CR5","unstructured":"Bermejo, I., Gimenez, Ph., Greuel, G.-M.: mregular.lib. A Singular 3.0.1 distributed library for computing the Castelnuovo-Mumford regularity (2005)"},{"issue":"1-2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0022-4049(00)00143-2","volume":"164","author":"I. Bermejo","year":"2001","unstructured":"Bermejo, I., Gimenez, P.: Computing the Castelnuovo-Mumford regularity of some subschemes of ${\\mathbb P}\\sb K\\sp n$ using quotients of monomial ideals. J. Pure Appl. Algebra\u00a0164(1-2), 23\u201333 (2001); Effective methods in algebraic geometry (Bath, 2000)","journal-title":"J. Pure Appl. Algebra"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.jalgebra.2005.05.020","volume":"303","author":"I. Bermejo","year":"2006","unstructured":"Bermejo, I., Gimenez, P.: Saturation and Catelnuovo-Mumford regularity. J. Algebra\u00a0303, 592\u2013617 (2006)","journal-title":"J. Algebra"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-56686-4_35","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"A.M. Bigatti","year":"1993","unstructured":"Bigatti, A.M., Conti, P., Robbiano, L., Traverso, C.: A Divide and Conquer algorithm for Hilbert-Poincar\u00e9 series, multiplicity and dimension of monomial ideals. In: Moreno, O., Cohen, G., Mora, T. (eds.) AAECC 1993. LNCS, vol.\u00a0673, pp. 76\u201388. Springer, Heidelberg (1993)"},{"key":"8_CR9","volume-title":"Undergraduate Texts in Mathematics","author":"D. Cox","year":"1997","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, varieties, and algorithms. In: Undergraduate Texts in Mathematics, 2nd edn. Springer, New York (1997); (An introduction to computational algebraic geometry and commutative algebra)","edition":"2"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-642-59932-3_10","volume-title":"Algorithmic algebra and number theory (Heidelberg, 1997)","author":"W. Decker","year":"1999","unstructured":"Decker, W., Greuel, G.-M., Pfister, G.: Primary decomposition: algorithms and comparisons. In: Algorithmic algebra and number theory (Heidelberg, 1997), pp. 187\u2013220. Springer, Berlin (1999)"},{"key":"8_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5350-1","volume-title":"Commutative algebra with a view toward algebraic geometry","author":"D. Eisenbud","year":"1995","unstructured":"Eisenbud, D.: Commutative algebra with a view toward algebraic geometry. Graduate Texts in Mathematics, vol.\u00a0150. Springer, New York (1995)"},{"key":"8_CR12","series-title":"Pure and Applied Mathematics","volume-title":"An introduction to Gr\u00f6bner bases","author":"R. Fr\u00f6berg","year":"1997","unstructured":"Fr\u00f6berg, R.: An introduction to Gr\u00f6bner bases, New York. Pure and Applied Mathematics. John Wiley & Sons Ltd., Chichester (1997)"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1006\/jsco.2000.0369","volume":"30","author":"M. Giusti","year":"2000","unstructured":"Giusti, M., H\u00e4gele, K., Lecerf, G., Marchand, J., Salvy, B.: The projective Noether Maple package: computing the dimension of a projective variety. J. Symbolic Comput.\u00a030(3), 291\u2013307 (2000)","journal-title":"J. Symbolic Comput."},{"key":"8_CR14","unstructured":"Grayson, D.R., Stillman, M.E.: Macaulay 2 version 1.1. software system for research in algebraic geometry, \n                       http:\/\/www.math.uiuc.edu\/Macaulay2\/"},{"key":"8_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04963-1","volume-title":"A Singular introduction to commutative algebra","author":"G.-M. Greuel","year":"2002","unstructured":"Greuel, G.-M., Pfister, G.: A Singular introduction to commutative algebra. Springer, Berlin (2002); With contributions by Olaf Bachmann, Christoph Lossen and Hans Sch\u00f6nemann, With 1 CD-ROM (Windows, Macintosh, and UNIX)"},{"key":"8_CR16","unstructured":"Greuel, G.-M., Pfister, G., Sch\u00f6nemann, H.: Singular 3.0.3. A Computer Algebra System for Polynomial Computations, Centre for Computer Algebra, University of Kaiserslautern (2005), \n                      http:\/\/www.singular.uni-kl.de"},{"key":"8_CR17","unstructured":"Hashemi, A.: noether.lib. A Singular 3.0.3 distributed library for computing the n\u0153ther normalization (2007)"},{"issue":"4","key":"8_CR18","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/S0885-064X(03)00031-1","volume":"19","author":"G. Lecerf","year":"2003","unstructured":"Lecerf, G.: Computing the Equidimensional Decomposition of an Algebraic Closed Set by means of Lifting Fibers. Journal of Complexity\u00a019(4), 564\u2013596 (2003)","journal-title":"Journal of Complexity"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-54522-0_108","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"T. Krick","year":"1991","unstructured":"Krick, T., Logar, A.: An algorithm for the computation of the radical of an ideal in the ring of polynomials. In: Mattson, H.F., Rao, T.R.N., Mora, T. (eds.) AAECC 1991. LNCS, vol.\u00a0539, pp. 195\u2013205. Springer, Heidelberg (1991)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-51083-4_65","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"A. Logar","year":"1989","unstructured":"Logar, A.: A Computational Proof of the Noether Normalization Lemma. In: Mora, T. (ed.) AAECC 1988. LNCS, vol.\u00a0357, pp. 259\u2013273. Springer, Heidelberg (1989)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/0747-7171(92)90018-Y","volume":"14","author":"F. Pauer","year":"1992","unstructured":"Pauer, F.: On lucky ideals for Gr\u00f6bner basis computations. J. Symbolic Comput.\u00a014, 471\u2013482 (1992)","journal-title":"J. Symbolic Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87827-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:12:43Z","timestamp":1715238763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87827-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540878261","9783540878278"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87827-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}