{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:24:09Z","timestamp":1725798249515},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441985"},{"type":"electronic","value":"9783662441992"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44199-2_8","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T22:17:11Z","timestamp":1406845031000},"page":"41-48","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Analysis of the Bivariate Buchberger Algorithm in Theorema"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Maletzky","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Buchberger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal (An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal). PhD thesis, Mathematical Institute, University of Innsbruck, Austria 1965: English translation in J. of Symbolic Computation, Special Issue on Logic, Mathematics, and Computer Science: Interactions\u00a041(3-4), 475\u2013511 (2006)","DOI":"10.1016\/j.jsc.2005.09.007"},{"key":"8_CR2","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 Groebner Bases. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol.\u00a072, pp. 3\u201321. Springer, Heidelberg (1979)"},{"key":"8_CR3","unstructured":"Buchberger, B., Winkler, F.: Miscellaneous Results on the Construction of Groebner-Bases for Polynomial Ideals. Technical Report 137, Johannes Kepler University Linz, Technisch-Naturwissenschaftliche Fakultaet, Insitut fuer Mathematik (June 1979)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-12868-9_98","volume-title":"Computer Algebra","author":"B. Buchberger","year":"1983","unstructured":"Buchberger, B.: A Note on the Complexity of Constructing Groebner-Bases. In: van Hulzen, J.A. (ed.) ISSAC 1983 and EUROCAL 1983. LNCS, vol.\u00a0162, pp. 137\u2013145. Springer, Heidelberg (1983)"},{"key":"8_CR5","unstructured":"Buchberger, B.: Miscellaneous Results on Groebner-Bases for Polynomial Ideals II. Technical Report 83-1, Department of Computer and Information Sciences, University of Delaware (1983)"},{"key":"8_CR6","unstructured":"Buchberger, B.: Mathematica as a Rewrite Language. In: Ida, T., Ohori, A., Takeichi, M. (eds.) Functional and Logic Programming (Proceedings of the 2nd Fuji International Workshop on Functional and Logic Programming, Shonan Village Center, November 1-4), pp. 1\u20134. World Scientific, Singapore (1996)"},{"key":"8_CR7","unstructured":"Buchberger, B.: Introduction to Groebner Bases. London Mathematical Society Lecture Notes Series, vol.\u00a0251. Cambridge University Press (April 1998)"},{"key":"8_CR8","unstructured":"Buchberger, B.: Groebner Rings in Theorema: A Case Study in Functors and Categories. Technical Report 2003-49, Johannes Kepler University Linz, Spezialforschungsbereich F013 (November 2003)"},{"key":"8_CR9","unstructured":"Buchberger, B.: Proving by First and Intermediate Principles, November 1-2, Invited Talk at Workshop on Types for \u201cMathematics\/Libraries of Formal Mathematics\u201d, University of Nijmegen, The Netherlands (2004)"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.jal.2005.10.006","volume":"4","author":"B. Buchberger","year":"2006","unstructured":"Buchberger, B., Cr\u01ceciun, A., Jebelean, T., Kov\u00e1cs, L., Kutsia, T., Nakagawa, K., Piroi, F., Popov, N., Robu, J., Rosenkranz, M., Windsteiger, W.: Theorema: Towards Computer-Aided Mathematical Theory Exploration. Journal of Applied Logic\u00a04(4), 470\u2013504 (2006)","journal-title":"Journal of Applied Logic"},{"key":"8_CR11","unstructured":"Giese, M., Buchberger, B.: Towards Practical Reflection for Formal Mathematics. RISC Report Series 07-05, Research Institute for Symbolic Computation (RISC), University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria (2007)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BFb0032839","volume-title":"EUROSAM 84","author":"M. Giusti","year":"1984","unstructured":"Giusti, M.: Some effectivity problems in polynomial ideal theory. In: Fitch, J. (ed.) EUROSAM 1984 and ISSAC 1984. LNCS, vol.\u00a0174, pp. 159\u2013171. Springer, Heidelberg (1984)"},{"key":"8_CR13","unstructured":"Wolfram Mathematica, \n                    \n                      http:\/\/www.wolfram.com\/mathematica\/"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E.W. Mayr","year":"1982","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics\u00a046(3), 305\u2013329 (1982)","journal-title":"Advances in Mathematics"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/BFb0032840","volume-title":"International Symposium on Symbolic and Algebraic Computation (EUROSAM 1984)","author":"H. Michael Moeller","year":"1984","unstructured":"Michael Moeller, H., Mora, F.: Upper and lower bounds for the degree of Groebner bases. In: Fitch, J. (ed.) EUROSAM 1984 and ISSAC 1984. LNCS, vol.\u00a0174, pp. 172\u2013183. Springer, Heidelberg (1984)"},{"key":"8_CR16","unstructured":"The Theorema system, \n                    \n                      http:\/\/www.risc.jku.at\/research\/theorema\/description\/"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Windsteiger, W.: Building Up Hierarchical Mathematical Domains Using Functors in THEOREMA. In: Armando, A., Jebelean, T. (eds.) Electronic Notes in Theoretical Computer Science. ENTCS, vol.\u00a023, pp. 401\u2013419. Elsevier (1999)","DOI":"10.1016\/S1571-0661(05)80612-7"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44199-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T13:34:09Z","timestamp":1558964049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44199-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441985","9783662441992"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44199-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}