{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:26:09Z","timestamp":1761978369735,"version":"build-2065373602"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s11786-013-0163-8","type":"journal-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T09:12:43Z","timestamp":1381569163000},"page":"321-339","source":"Crossref","is-referenced-by-count":4,"title":["Improved Agreeing-Gluing Algorithm"],"prefix":"10.1007","volume":"7","author":[{"given":"Igor","family":"Semaev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,13]]},"reference":[{"key":"163_CR1","doi-asserted-by":"crossref","unstructured":"Bouillaguet, C., Chen, H.-C. K., Cheng, C.-M., Chou, T., Niederhagen, R., Shamir, A., Yang, B.-Y.: Fast exhaustive search for polynomial systems in F 2. IACR ePrint Archive, report 2010\/313","DOI":"10.1007\/978-3-642-15031-9_14"},{"key":"163_CR2","unstructured":"Bardet, M., Faug\u00e9re, J.-C., Salvy, B.: Complexity of Gr\u00f6bner basis computation for semi-regular overdetermined sequences over F 2 with solutions in F 2. Research report RR\u20135049, INRIA (2003)"},{"key":"163_CR3","unstructured":"Bardet, M., Faug\u00e9re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems. In: MEGA (2005)"},{"key":"163_CR4","first-page":"19","volume":"39","author":"B. Buchberger","year":"1976","unstructured":"Buchberger B.: Theoretical basis for the reduction of polynomials to canonical forms. SIGSAM Bull. 39, 19\u201324 (1976)","journal-title":"SIGSAM Bull."},{"key":"163_CR5","volume-title":"Differential and Integral Calculus, vol. 1","author":"R. Courant","year":"1988","unstructured":"Courant R.: Differential and Integral Calculus, vol. 1. Interscience Publishers, New York (1988)"},{"key":"163_CR6","doi-asserted-by":"crossref","unstructured":"Courtois, N.T., Bard, G.V.: Algebraic cryptanalysis of the data encryption standard. In: Cryptogr. and Coding, LNCS 4887, pp. 152\u2013169. Springer, New York (2007)","DOI":"10.1007\/978-3-540-77272-9_10"},{"key":"163_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0304-3975(01)00174-8","volume":"289","author":"E. Dantsin","year":"2002","unstructured":"Dantsin E., Goerdt A., Hirsch E.A., Kannan R., Kleinberg J.M., Papadimitriou C.H., Raghavan P., Sch\u0161ning U.: A deterministic (2\u22122\/(k\u00a0+\u00a01)) n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289, 69\u201383 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"163_CR8","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: MiniSat home page. http:\/\/minisat.se\/"},{"key":"163_CR9","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":"Faug\u00e8re J.-C.: A new efficient algorithm for computing Gr\u0161bner bases (F4). J. Pure Appl. Algebra 139, 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"163_CR10","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: ISSAC 2002, pp. 75\u201383. ACM Press, New York (2002)","DOI":"10.1145\/780506.780516"},{"key":"163_CR11","first-page":"61","volume":"82","author":"K. Iwama","year":"2004","unstructured":"Iwama K.: Worst-Case Upper Bounds for kSAT. Bull. EATCS 82, 61\u201371 (2004)","journal-title":"Bull. EATCS"},{"key":"163_CR12","doi-asserted-by":"crossref","unstructured":"Iwama, K., Seto, K., Takai, T., Tamaki, S.: Improved randomised algorithms for 3-SAT. In: ISAAC 2010, Part I, LNCS 6506, pp. 73\u201384 (2010)","DOI":"10.1007\/978-3-642-17517-6_9"},{"key":"163_CR13","volume-title":"Random Allocations","author":"V. Kolchin","year":"1978","unstructured":"Kolchin V., Sevast\u2019yanov A., Chistyakov V.: Random Allocations. Wiley, New York (1978)"},{"key":"163_CR14","doi-asserted-by":"crossref","unstructured":"Lazard, D.: Gr\u00f6bner-bases, Gaussian elimination and resolution of systems of algebraic equations. In: EUROCAL, pp. 146\u2013156 (1983)","DOI":"10.1007\/3-540-12868-9_99"},{"key":"163_CR15","unstructured":"MAPLE home page. http:\/\/www.maplesoft.com"},{"key":"163_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: On selecting a satisfying truth assignment. In: Proc. FOCS\u201991, pp. 163\u2013169 (1991)","DOI":"10.1109\/SFCS.1991.185365"},{"key":"163_CR17","unstructured":"Raddum, H.: Solving non-linear sparse equation systems over GF(2) using graphs. University of Bergen (2004, preprint)"},{"key":"163_CR18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10623-008-9180-z","volume":"49","author":"H. Raddum","year":"2008","unstructured":"Raddum H., Semaev I.: Solving multiple right hand sides linear equations. Des. Codes Cryptogr. 49, 147\u2013160 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"163_CR19","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s00453-001-0094-7","volume":"32","author":"U. Sch\u00f6ning","year":"2002","unstructured":"Sch\u00f6ning U.: A probabilistic algorithm for k-Sat based on limited local search and restart. Algoritmica 32, 615\u2013623 (2002)","journal-title":"Algoritmica"},{"key":"163_CR20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10623-008-9182-x","volume":"49","author":"I. Semaev","year":"2008","unstructured":"Semaev I.: On solving sparse algebraic equations over finite fields. Des. Codes Cryptogr. 49, 47\u201360 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"163_CR21","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1137\/070700371","volume":"39","author":"I. Semaev","year":"2009","unstructured":"Semaev I.: Sparse algebraic equations over finite fields. SIAM J. Comput. 39, 388\u2013409 (2009)","journal-title":"SIAM J. Comput."},{"key":"163_CR22","first-page":"107","volume":"45","author":"I. Semaev","year":"2010","unstructured":"Semaev I., Mikus M.: Methods to solve algebraic equations in cryptanalysis. Tatra Mt. Math. Publ. 45, 107\u2013136 (2010)","journal-title":"Tatra Mt. Math. Publ."},{"key":"163_CR23","unstructured":"Semaev, I.: Improved agreeing-gluing algorithm. 2nd Int. Conf. on Symb. Comp. and Crypt., Royal Holloway, University of London, pp. 73\u201388 (2010)"},{"key":"163_CR24","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10623-010-9465-x","volume":"59","author":"I. Semaev","year":"2011","unstructured":"Semaev I.: Sparse Boolean equations and circuit lattices. Des. Codes Cryptogr. 59, 349\u2013364 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"163_CR25","doi-asserted-by":"crossref","unstructured":"Schilling, T.E., Raddum, H.: Solving equation systems by agreeing and learning. In: WAIFI 2010, LNCS 6087, pp. 151\u2013165. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13797-6_11"},{"key":"163_CR26","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D.H. Wiedemann","year":"1986","unstructured":"Wiedemann D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory 32, 54\u201362 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"163_CR27","first-page":"401","volume-title":"On Asymptotic Security Estimates in XL and Gr\u00f6bner Bases-Related Algebraic Cryptanalysis, LNCS 3269","author":"B.-Y. Yang","year":"2004","unstructured":"Yang B.-Y., Chen J.-M., Courtois N.: On Asymptotic Security Estimates in XL and Gr\u00f6bner Bases-Related Algebraic Cryptanalysis, LNCS 3269, pp. 401\u2013413. Springer, Berlin (2004)"},{"key":"163_CR28","unstructured":"Zakrevskij, A., Vasilkova, I.: Reducing large systems of Boolean equations. 4th Int. workshop on Boolean problems, Freiberg University (2000)"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-013-0163-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-013-0163-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-013-0163-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T16:51:29Z","timestamp":1746031889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-013-0163-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s11786-013-0163-8","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"type":"print","value":"1661-8270"},{"type":"electronic","value":"1661-8289"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}