{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:25:15Z","timestamp":1648506315268},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:00:00Z","timestamp":1594598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:00:00Z","timestamp":1594598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00200-020-00449-5","type":"journal-article","created":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T10:04:05Z","timestamp":1594634645000},"page":"389-409","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A comparison of unrestricted dynamic Gr\u00f6bner Basis algorithms"],"prefix":"10.1007","volume":"31","author":[{"given":"Gabriel Mattos","family":"Langeloh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,13]]},"reference":[{"key":"449_CR1","doi-asserted-by":"crossref","unstructured":"Caboara, M.: A Dynamic algorithm for Gr\u00f6bner basis computation. In: Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, pp. 275\u2013283 (1993)","DOI":"10.1145\/164081.164141"},{"issue":"1\u20132","key":"449_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00200-014-0216-5","volume":"25","author":"M Caboara","year":"2014","unstructured":"Caboara, M., Perry, J.: Reducing the size and number of linear programs in a dynamic Gr\u00f6bner basis algorithm. Appl. Algebra Eng. Commun. Comput. 25(1\u20132), 99\u2013117 (2014). https:\/\/doi.org\/10.1007\/s00200-014-0216-5","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"449_CR3","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0145","author":"S Collart","year":"1997","unstructured":"Collart, S., Kalkbrener, M., Mall, D.: Converting bases with the Gr\u00f6bner walk. J. Symb. Comput. (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0145","journal-title":"J. Symb. Comput."},{"key":"449_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/b138611","volume-title":"Using Algebraic Geometry","author":"D Cox","year":"2005","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Using Algebraic Geometry, 2nd edn. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/b138611","edition":"2"},{"key":"449_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16721-3","volume-title":"Ideals, Varieties, and Algorithms","author":"D Cox","year":"2015","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, 4th edn. Springer, Berlin (2015)","edition":"4"},{"key":"449_CR6","unstructured":"Eder, C.: Singular benchmarks. https:\/\/github.com\/ederc\/singular-benchmarks (2018)"},{"key":"449_CR7","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-96-00662-3","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). https:\/\/doi.org\/10.1090\/S0273-0979-96-00662-3"},{"issue":"1","key":"449_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139(1), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"449_CR9","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International symposium on Symbolic and Algebraic Computation\u2014ISSAC \u201902 pp. 75\u201383 (2002). https:\/\/doi.org\/10.1145\/780506.780516","DOI":"10.1145\/780506.780516"},{"issue":"4","key":"449_CR10","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."},{"key":"449_CR11","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.C., Joux, A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gr\u00f6bner Bases. In: Advances in Cryptology-CRYPTO 2003, pp. 44\u201360. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_3","DOI":"10.1007\/978-3-540-45146-4_3"},{"key":"449_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80048-8","author":"R Gebauer","year":"1988","unstructured":"Gebauer, R., M\u00f6ller, H.M.: On an installation of Buchberger\u2019s algorithm. J. Symb. Comput. (1988). https:\/\/doi.org\/10.1016\/S0747-7171(88)80048-8","journal-title":"J. Symb. Comput."},{"key":"449_CR13","doi-asserted-by":"publisher","unstructured":"Giovini, A., Mora, T., Niesi, G., Robbiano, L., Traverso, C.: \u201cOne sugar cube, please\u201d or selection strategies in the Buchberger algorithm. In: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation\u2014ISSAC \u201991 (1991). https:\/\/doi.org\/10.1145\/120694.120701","DOI":"10.1145\/120694.120701"},{"issue":"2","key":"449_CR14","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1137\/0406019","volume":"6","author":"P Gritzmann","year":"1993","unstructured":"Gritzmann, P., Sturmfels, B.: Minkowski addition of polytopes: computational complexity and application to Gr\u00f6bner Bases. SIAM J. Discrete Math. 6(2), 246\u2013269 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"449_CR15","doi-asserted-by":"publisher","unstructured":"Hashemi, A., Talaashrafi, D.: A note on dynamic Gr\u00f6bner Bases computation. In: International Workshop on Computer Algebra in Scientific Computing, pp. 276\u2013288. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-540-75187-8","DOI":"10.1007\/978-3-540-75187-8"},{"key":"449_CR16","unstructured":"Langeloh, G.M.: Unrestricted dynamic Gr\u00f6bner basis algorithms. Master\u2019s thesis, Universidade Federal do Rio Grande do Sul (2019)"},{"key":"449_CR17","doi-asserted-by":"crossref","unstructured":"Perry, J.: Exploring the dynamic Buchberger algorithm. In: Proceedings of the 2017 International Symposium on Symbolic and Algebraic Computation, pp. 365\u2013372 (2017)","DOI":"10.1145\/3087604.3087643"},{"key":"449_CR18","doi-asserted-by":"publisher","unstructured":"Robbiano, L.: Term orderings on the polynomial ring. In: European Conference on Computer Algebra, pp. 513\u2013517. Springer, Berlin (1985). https:\/\/doi.org\/10.1007\/3-540-15984-3_321","DOI":"10.1007\/3-540-15984-3_321"},{"key":"449_CR19","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 8.3) (2018)"},{"key":"449_CR20","doi-asserted-by":"publisher","unstructured":"Thomas, R.R.: Gr\u00f6bner Bases in integer programming. Handbook of Combinatorial Optimization pp. 533\u2013572 (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_8","DOI":"10.1007\/978-1-4613-0303-9_8"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00449-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-020-00449-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00449-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T23:58:08Z","timestamp":1626134288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-020-00449-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,13]]},"references-count":20,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["449"],"URL":"https:\/\/doi.org\/10.1007\/s00200-020-00449-5","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,13]]},"assertion":[{"value":"17 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}