{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:24:13Z","timestamp":1725798253478},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441985"},{"type":"electronic","value":"9783662441992"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44199-2_59","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T22:17:11Z","timestamp":1406845031000},"page":"382-389","source":"Crossref","is-referenced-by-count":2,"title":["Effective Computation of Radical of Ideals and Its Application to Invariant Theory"],"prefix":"10.1007","author":[{"given":"Amir","family":"Hashemi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-54195-0_52","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"M.E. Alonso","year":"1991","unstructured":"Alonso, M.E., Mora, T., Raimondo, M.: Local Decomposition Algorithms. In: Sakata, S. (ed.) AAECC 1990. LNCS, vol.\u00a0508, pp. 208\u2013221. Springer, Heidelberg (1991)"},{"issue":"1","key":"59_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01389151","volume":"87","author":"D. Bayer","year":"1987","unstructured":"Bayer, D., Stillman, M.: A Criterion for Detecting m-Regularity. Invent. Math.\u00a087(1), 1\u201311 (1987)","journal-title":"Invent. Math."},{"doi-asserted-by":"crossref","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner Bases: a Computational Approach to Commutative Algebra. Springer (1993)","key":"59_CR3","DOI":"10.1007\/978-1-4612-0913-3"},{"key":"59_CR4","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 Castelnuovo Mumford Regularity. J. Algebra\u00a0303, 592\u2013617 (2006)","journal-title":"J. Algebra"},{"unstructured":"Buchberger, B.: Ein Algorithms zum Auffinden der Basiselemente des Restklassenrings nach einem nuildimensionalen Polynomideal. PhD thesis, Universit\u00e4t Innsbruck (1965)","key":"59_CR5"},{"issue":"3-4","key":"59_CR6","first-page":"475","volume":"41","author":"B. Buchberger","year":"2006","unstructured":"Buchberger, B.: An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal. German, English translation: J. Symbolic Comput., Special Issue on Logic, Mathematics, and Computer Science: Interactions\u00a041(3-4), 475\u2013511 (2006)","journal-title":"German, English translation: J. Symbolic Comput., Special Issue on Logic, Mathematics, and Computer Science: Interactions"},{"key":"59_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-09519-5_52","volume-title":"Symbolic and Algebraic Computation","author":"B. Buchberger","year":"1979","unstructured":"Buchberger, B.: A Criterion for Detecting Unnecessary Reductions in the Construction of Gr\u00f6bner Bases. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol.\u00a072, pp. 3\u201321. Springer, Heidelberg (1979)"},{"key":"59_CR8","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. Springer, New York (1995)"},{"key":"59_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01231331","volume":"110","author":"D. Eisenbud","year":"1992","unstructured":"Eisenbud, D., Huneke, C., Vasconcelos, W.V.: Direct Methods for Primary Decomposition. Invent. Math.\u00a0110, 207\u2013235 (1992)","journal-title":"Invent. Math."},{"key":"59_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04958-7","volume-title":"Computational Invariant Theory","author":"H. Derksen","year":"2002","unstructured":"Derksen, H., Kemper, G.: Computational Invariant Theory. Springer, Berlin (2002)"},{"key":"59_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0747-7171(88)80040-3","volume":"6","author":"P. Gianni","year":"1988","unstructured":"Gianni, P., Trager, B., Zacharias, G.: Gr\u00f6bner Bases and Primary Decomposition of Polynomial Ideals. J. Symb. Comput.\u00a06, 149\u2013167 (1988)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"59_CR12","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 N\u0153ther Maple Package: Computing the Dimension of a Projective Variety. J. Symbolic Comput.\u00a030(3), 291\u2013307 (2000)","journal-title":"J. Symbolic Comput."},{"unstructured":"Hashemi, A.: noether.lib. A Singular 3.0.3 distributed library for computing the N\u0153ther normalization (2007)","key":"59_CR13"},{"key":"59_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-87827-8_8","volume-title":"Computer Mathematics","author":"A. Hashemi","year":"2008","unstructured":"Hashemi, A.: Efficient Algorithms for Computing N\u0153ther Normalization. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol.\u00a05081, pp. 97\u2013107. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Hashemi, A., Schweinfurter, M., Seiler, W.M.: Deterministically Computing Reduction Numbers of Polynomial Ideals. arXiv:1404.1721, 16 pages (2014)","key":"59_CR15","DOI":"10.1007\/978-3-319-10515-4_14"},{"key":"59_CR16","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/BF01206635","volume":"95","author":"D. Hermann","year":"1926","unstructured":"Hermann, D.: Die Frage der endlich vielen Schritte in der Theorie der Polynomideale. Math. Ann.\u00a095, 736\u2013788 (1926)","journal-title":"Math. Ann."},{"key":"59_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1006\/jsco.1996.0017","volume":"21","author":"G. Kemper","year":"1996","unstructured":"Kemper, G.: Calculating Invariant Rings of Finite Groups over Arbitrary Fields. J. Symb. Comput.\u00a021, 351\u2013366 (1996)","journal-title":"J. Symb. Comput."},{"key":"59_CR18","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1006\/jsco.1996.0017","volume":"21","author":"G. Kemper","year":"1996","unstructured":"Kemper, G.: Calculating Invariant Rings of Finite Groups over Arbitrary Fields. J. Symb. Comput.\u00a021, 351\u2013366 (1996)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"59_CR19","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. J. of Complexity\u00a019(4), 564\u2013596 (2003)","journal-title":"J. of Complexity"},{"key":"59_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 N\u0153ther Normalization Lemma. In: Mora, T. (ed.) AAECC 1988. LNCS, vol.\u00a0357, pp. 259\u2013273. Springer, Heidelberg (1989)"},{"key":"59_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"59_CR22","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1006\/jsco.2001.0446","volume":"32","author":"R. Matsumoto","year":"2001","unstructured":"Matsumoto, R.: Computing the Radical of an Ideal in Positive Characteristic. J. Symb. Comput.\u00a032, 263\u2013271 (2001)","journal-title":"J. Symb. Comput."},{"key":"59_CR23","doi-asserted-by":"publisher","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)"},{"key":"59_CR24","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1016\/j.jsc.2009.02.004","volume":"44","author":"D. Robertz","year":"2009","unstructured":"Robertz, D.: Noether Normalization Guided by Monomial Cone Decompositions. J. Symb. Comput.\u00a044, 1359\u20131373 (2009)","journal-title":"J. Symb. Comput."},{"key":"59_CR25","doi-asserted-by":"publisher","first-page":"3933","DOI":"10.1080\/00927872.2011.599354","volume":"40","author":"W.M. Seiler","year":"2012","unstructured":"Seiler, W.M.: Effective Genericity, Delta-Regularity and Strong N\u0153ther Position. Communications in Algebra\u00a040, 3933\u20133949 (2012)","journal-title":"Communications in Algebra"},{"key":"59_CR26","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00200-009-0101-9","volume":"20","author":"W.M. Seiler","year":"2009","unstructured":"Seiler, W.M.: A Combinatorial Approach to Involution and \u03b4-Regularity II: Structure Analysis of Polynomial Modules with Pommaret Bases. Appl. Alg. Eng. Comm. Comp.\u00a020, 261\u2013338 (2009)","journal-title":"Appl. Alg. Eng. Comm. Comp."},{"unstructured":"Sturmfels, B.: Algorithm in Invariant Theory. Springer (2008)","key":"59_CR27"},{"doi-asserted-by":"crossref","unstructured":"Vasconcelos, W.V.: Computational Methods in Commutative Algebra and Algebraic Geometry. Springer (1998)","key":"59_CR28","DOI":"10.1007\/978-3-642-58951-5"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44199-2_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T13:46:11Z","timestamp":1558964771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44199-2_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441985","9783662441992"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44199-2_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}