{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:48:06Z","timestamp":1743011286989,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031417238"},{"type":"electronic","value":"9783031417245"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-41724-5_8","type":"book-chapter","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T07:02:38Z","timestamp":1692774158000},"page":"141-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Complexity of\u00a0Linear Algebra Operations over\u00a0Algebraic Extension Fields"],"prefix":"10.1007","author":[{"given":"Amir","family":"Hashemi","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Lichtblau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"key":"8_CR1","volume-title":"An Introduction to Gr\u00f6bner Bases","author":"WW Adams","year":"1994","unstructured":"Adams, W.W., Loustaunau, P.: An Introduction to Gr\u00f6bner Bases, vol. 3. American Mathematical Society, Providence (1994)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 522\u2013539. Society for Industrial and Applied Mathematics (2021)","DOI":"10.1137\/1.9781611976465.32"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(97)00064-9","volume":"187","author":"B Amrhein","year":"1997","unstructured":"Amrhein, B., Gloor, O., K\u00fcchlin, W.: On the walk. Theor. Comput. Sci. 187, 179\u2013202 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR4","series-title":"In cooperation with Heinz Kredel","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra","author":"T Becker","year":"1993","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra. In cooperation with Heinz Kredel, Springer, New York (1993). https:\/\/doi.org\/10.1007\/978-1-4612-0913-3"},{"key":"8_CR5","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, E.W. (ed.) EUROSAM 1979. LNCS, vol. 72, pp. 3\u201321. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_52"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Gr\u00f6bner bases: an algorithmic method in polynomial ideal theory. In: Multidimensional Systems Theory, Progress, Directions and Open Problems. Mathematics Application. vol.16, pp. 184\u2013232. D. Reidel Publ. Co. (1985)","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"8_CR7","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. thesis, Universit\u00e4t Innsbruck (1965)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Bruno Buchberger\u2019s PhD thesis 1965: an algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symb. Comput. 41(3\u20134), 475\u2013511 (2006)","DOI":"10.1016\/j.jsc.2005.09.007"},{"issue":"7","key":"8_CR9","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/BF01178683","volume":"28","author":"DG Cantor","year":"1991","unstructured":"Cantor, D.G., Kaltofen, E.: On fast multiplication of polynomials over arbitrary algebras. Acta Inf. 28(7), 693\u2013701 (1991)","journal-title":"Acta Inf."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1006\/jsco.1996.0145","volume":"24","author":"S Collart","year":"1997","unstructured":"Collart, S., Kalkbrener, M., Mall, D., Solern\u00f3, P.: Converting bases with the Gr\u00f6bner walk. J. Symb. Comput. 24, 465\u2013469 (1997)","journal-title":"J. Symb. Comput."},{"key":"8_CR11","series-title":"An Introduction to Computational Algebraic Geometry and Commutative Algebra","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties, and Algorithms","author":"D Cox","year":"2007","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd edn. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-0-387-35651-8","edition":"3"},{"issue":"1\u20133","key":"8_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0166-218X(91)90109-A","volume":"33","author":"A Dickenstein","year":"1991","unstructured":"Dickenstein, A., Fitchas, N., Giusti, M., Sessa, C.: The membership problem for unmixed polynomial ideals is solvable in single exponential time. Discrete Appl. Math. 33(1\u20133), 73\u201394 (1991)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"JC Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J.C., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"issue":"2\u20133","key":"8_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0747-7171(88)80048-8","volume":"6","author":"R Gebauer","year":"1988","unstructured":"Gebauer, R., M\u00f6ller, H.M.: On an installation of Buchberger\u2019s algorithm. J. Symb. Comput. 6(2\u20133), 275\u2013286 (1988)","journal-title":"J. Symb. Comput."},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Hartshorne, R.: Algebraic Geometry. Corr. 8rd printing, vol. 52. Springer, New York (1977). https:\/\/doi.org\/10.1007\/978-1-4757-3849-0","DOI":"10.1007\/978-1-4757-3849-0"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-030-60026-6_14","volume-title":"Computer Algebra in Scientific Computing","author":"A Hashemi","year":"2020","unstructured":"Hashemi, A., Heintz, J., Pardo, L.M., Solern\u00f3, P.: Intrinsic complexity for constructing zero-dimensional Gr\u00f6bner Bases. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2020. LNCS, vol. 12291, pp. 245\u2013265. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60026-6_14"},{"key":"8_CR17","unstructured":"Hashemi, A., M.-Alizadeh, B.: Computing minimal polynomial of matrices over algebraic extension fields. Bull. Math. Soc. Sci. Math. Roum. Nouv. S\u00e9r. 56(2), 217\u2013228 (2013)"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.jco.2019.03.002","volume":"55","author":"J van der Hoeven","year":"2019","unstructured":"van der Hoeven, J., Lecerf, G.: Accelerated tower arithmetic. J. Complexity 55, 26 (2019). id\/No 101402","journal-title":"J. Complexity"},{"key":"8_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28296-3","volume-title":"Computational Commutative Algebra. II","author":"M Kreuzer","year":"2005","unstructured":"Kreuzer, M., Robbiano, L.: Computational Commutative Algebra. II. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/3-540-28296-3"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-54522-0_111","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"L Langemyr","year":"1991","unstructured":"Langemyr, L.: Algorithms for a multiple algebraic extension II. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds.) AAECC 1991. LNCS, vol. 539, pp. 224\u2013233. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54522-0_111"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of ISSAC 2014, pp. 296\u2013303. ACM Press, New York (2014)","DOI":"10.1145\/2608628.2608664"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.jsc.2014.09.012","volume":"68","author":"R Lebreton","year":"2015","unstructured":"Lebreton, R.: Relaxed Hensel lifting of triangular sets. J. Symb. Comput. 68, 230\u2013258 (2015)","journal-title":"J. Symb. Comput."},{"issue":"7","key":"8_CR23","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1016\/j.jsc.2008.04.019","volume":"44","author":"X Li","year":"2009","unstructured":"Li, X., Moreno Maza, M., Schost, \u00c9.: Fast arithmetic for triangular sets: from theory to practice. J. Symb. Comput. 44(7), 891\u2013907 (2009)","journal-title":"J. Symb. Comput."},{"key":"8_CR24","unstructured":"Lichtblau, D.: Practical computations with Gr\u00f6bner bases (2009). https:\/\/www.researchgate.net\/publication\/260165637_Practical_computations_with_Grobner_bases"},{"issue":"5\u20138","key":"8_CR25","doi-asserted-by":"publisher","first-page":"369","DOI":"10.12988\/ija.2013.13037","volume":"7","author":"D Lichtblau","year":"2013","unstructured":"Lichtblau, D.: Applications of strong Gr\u00f6bner bases over Euclidean domains. Int. J. Algebra 7(5\u20138), 369\u2013390 (2013)","journal-title":"Int. J. Algebra"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-32973-9_19","volume-title":"Computer Algebra in Scientific Computing","author":"M Moreno Maza","year":"2012","unstructured":"Moreno Maza, M., Schost, \u00c9., Vrbik, P.: Inversion modulo zero-dimensional regular chains. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2012. LNCS, vol. 7442, pp. 224\u2013235. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32973-9_19"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1112\/S1461157000000590","volume":"11","author":"M Neunh\u00f6ffer","year":"2008","unstructured":"Neunh\u00f6ffer, M., Praeger, C.E.: Computing minimal polynomials of matrices. LMS J. Comput. Math. 11, 252\u2013279 (2008)","journal-title":"LMS J. Comput. Math."},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/11832225_9","volume-title":"Mathematical Software - ICMS 2006","author":"M Noro","year":"2006","unstructured":"Noro, M.: An efficient implementation for computing Gr\u00f6bner bases over algebraic number fields. In: Iglesias, A., Takayama, N. (eds.) ICMS 2006. LNCS, vol. 4151, pp. 99\u2013109. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11832225_9"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Storjohann, A.: An $$O(n^3)$$ algorithm for the Frobenius normal form. In: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC 1998, Rostock, Germany, 13\u201315 August 1998, pp. 101\u2013104. ACM Press, New York (1998)","DOI":"10.1145\/281508.281570"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41724-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T16:38:44Z","timestamp":1729960724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41724-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031417238","9783031417245"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41724-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Havana","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuba","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.17","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.41","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}