{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:18:37Z","timestamp":1774797517080,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s11424-011-0218-3","type":"journal-article","created":{"date-parts":[[2011,12,5]],"date-time":"2011-12-05T09:59:34Z","timestamp":1323079174000},"page":"1218-1231","source":"Crossref","is-referenced-by-count":14,"title":["The F5 algorithm in Buchberger\u2019s style"],"prefix":"10.1007","volume":"24","author":[{"given":"Yao","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingkang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,6]]},"reference":[{"key":"218_CR1","unstructured":"B. Buchberger, Ein Algorithmus zum auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, PhD thesis, Innsbruck, 1965."},{"issue":"1","key":"218_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J. C. Faug\u00e8re","year":"1999","unstructured":"J. C. Faug\u00e8re, A new efficient algorithm for computing Gr\u00f6bner bases (f4), Journal of Pure and Applied Algebra, 1999, 139(1): 61\u201388.","journal-title":"Journal of Pure and Applied Algebra"},{"key":"218_CR3","doi-asserted-by":"crossref","unstructured":"J. C. Faug\u00e8re, A new efficient algorithm for computing Gr\u00f6nber bases without reduction to zero (F5), Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201902, 2002.","DOI":"10.1145\/780506.780516"},{"key":"218_CR4","doi-asserted-by":"crossref","unstructured":"R. Gebauer and H. M. Moller, Buchberger\u2019s algorithm and staggered linear bases, Proceedings of the 1986 Symposium on Symbolic and Algebraic computation, Waterloo, Ontario, Canada, 1986.","DOI":"10.1145\/32439.32482"},{"key":"218_CR5","volume-title":"Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201991","author":"A. Giovini","year":"1991","unstructured":"A. Giovini, T. Mora, G. Niesi, L. Robbiano and C. Traverso, One sugar cube, please, or Selection strategies in the Buchberger Algorithm, S. M. Watt, editor, Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201991, ACM Press, Bonn, West Germany, 1991."},{"key":"218_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-12868-9_99","volume":"162","author":"D. Lazard","year":"1983","unstructured":"D. Lazard, Gaussian elimination and resolution of systems of algebraic equations, Proc. EUROCAL 83, Lect. Notes in Comp. Sci., Springer Verlag, 1983, 162: 146\u2013157.","journal-title":"Proc. EUROCAL 83, Lect. Notes in Comp. Sci."},{"key":"218_CR7","volume-title":"Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201992","author":"T. Mora","year":"1992","unstructured":"T. Mora, H. M. M\u00f6ller and C. Traverso, Gr\u00f6bner Bases computation using syzygies, Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201992 (ed. by P. S. Wang), ACM Press, Berkeley, California, United States, 1992."},{"key":"218_CR8","unstructured":"M. Bardet and J. C. Faug\u00e8re, B. Salvy, Complexity of Gr\u00f6bner basis computation for Semi-regular Overdetermined sequences over $\\mathbb{F}_2 $ with solutions in $\\mathbb{F}_2 $ , Proceedings of International Conference on Polynomial System Solving Paris, November 24\u201326, 2004, in honor of Daniel Lazard."},{"key":"218_CR9","unstructured":"J. C. Faug\u00e8re and G. Ars, An Algebraic Cryptanalysis of Nonlinear Filter Generators Using Gr\u00f6bner Bases, TR No. 4739, INRIA, 2003."},{"key":"218_CR10","unstructured":"T. Stegers, Faug\u00e8re\u2019s F5 Algorithm Revisited, Thesis for the degree of Diplom-Mathematiker, 2005."},{"key":"218_CR11","unstructured":"C. Eder, On the criteria of the F5 algorithm, ArXiv: 0804.2033v1, 2008."},{"key":"218_CR12","unstructured":"C. Eder and J. Perry, F5C: A variant of Faug\u00e8re\u2019s F5 algorithm with reduced Gr\u00f6bner bases, ArXiv: 0906.2967v5, 2009."},{"key":"218_CR13","unstructured":"G. Ars and A. Hashemi, Extended F5 criteria, MEGA, Barcelona, 2009."},{"key":"218_CR14","doi-asserted-by":"crossref","unstructured":"S. H. Gao, Y. H. Guan, and F. Volny, A new incremental algorithm for computing Gr\u00f6bner Bases, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201910, Munchen, 2010.","DOI":"10.1145\/1837934.1837944"},{"issue":"9","key":"218_CR15","first-page":"1266","volume":"29","author":"Y. Sun","year":"2009","unstructured":"Y. Sun and D. K. Wang, Branch Groebner Bases Algorithm over Boolean Ring (in Chinese), Journal of Systems Science and Mathematical Sciences, 2009, 29(9): 1266\u20131277.","journal-title":"Journal of Systems Science and Mathematical Sciences"},{"key":"218_CR16","unstructured":"Y. Sun and D. K. Wang, The implementation and complexity analysis of the branch Groebner bases algorithm over boolean ring, ASCM 2009 (ed. by M. Suzuki etc.), ISSN 1881-4042, 2009."},{"key":"218_CR17","unstructured":"Y. Sun and D. K. Wang, A new proof for the correctness of F5 algorithm, ArXiv: 1004.0084, 2010."},{"key":"218_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-09519-5_52","volume":"72","author":"B. Buchberger","year":"1979","unstructured":"B. Buchberger, A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner basis, Proceedings of EUROCAL 79, Lect. Notes in Comp. Sci., Springer-Verlag, 1979, 72: 3\u201321.","journal-title":"Proceedings of EUROCAL 79, Lect. Notes in Comp. Sci."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-011-0218-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-011-0218-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-011-0218-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T09:09:53Z","timestamp":1561021793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-011-0218-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["218"],"URL":"https:\/\/doi.org\/10.1007\/s11424-011-0218-3","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}