{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:05:34Z","timestamp":1775012734592,"version":"3.50.1"},"reference-count":19,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"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":["Program Comput Soft"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1134\/s0361768809020042","type":"journal-article","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T13:20:25Z","timestamp":1238419225000},"page":"90-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Role of involutive criteria in computing Boolean Gr\u00f6bner bases"],"prefix":"10.1134","volume":"35","author":[{"given":"V. P.","family":"Gerdt","sequence":"first","affiliation":[]},{"given":"M. V.","family":"Zinin","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2009,3,29]]},"reference":[{"key":"2004_CR1","first-page":"44","volume":"2729","author":"J.-C. Faug\u00e8re","year":"2003","unstructured":"Faug\u00e8re, J.-C. and Joux, A., Algebraic Cryptanalysis of Hidden Field Equations (HFE) Using Gr\u00f6bner Bases, LNCS, Springer, 2003, vol. 2729, pp. 44\u201360.","journal-title":"LNCS"},{"key":"2004_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Proc. of ISSAC 2002","author":"J.-C. Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re, J.-C., A New Efficient Algorithm for Computing Gr\u00f6bner Bases without Reduction to Zero ($$\n\\mathbb{F}\n$$\n                           5), Proc. of ISSAC 2002, New York: ACM, 2002, pp. 75\u201383."},{"key":"2004_CR3","unstructured":"http:\/\/magma.maths.usyd.edu.au\/users\/allan\/gb\/."},{"issue":"s.1\u20133","key":"2004_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. A. N. E. A. f. C. G. B. Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C., A New Efficient Algorithm for Computing Gr\u00f6bner Bases ($$\n\\mathbb{F}\n$$\n                           4), Pure Applied Algebra, 1999, vol. 139, nos. 1\u20133, pp. 61\u201368.","journal-title":"Pure Applied Algebra"},{"key":"2004_CR5","unstructured":"Bardet, M., Faug\u00e8re, J.-C., and Salvy, B., Complexity of Gr\u00f6bner Basis Computation for Semi-regular Overdetermined Sequences over $$\n\\mathbb{F}\n$$\n                           2 with solutions in $$\n\\mathbb{F}\n$$\n                           2, INRIA report RR-5049, 2003."},{"key":"2004_CR6","unstructured":"Brickenstein, M., Dreyer, A., Greuel, G.-M., and Wienand, O., New Developments in the Theory of Gr\u00f6bner Bases and Applications to Formal Verification. arXiv:math.AC\/0801.1177."},{"key":"2004_CR7","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/S0378-4754(97)00127-4","volume":"45","author":"V.P. Gerdt","year":"1998","unstructured":"Gerdt, V.P. and Blinkov, Yu.A., Involutive Bases of Polynomial Ideals, Math. Comput. Simulation, 1998, vol. 45, pp. 519\u2013542. arXiv:math.AC\/9912027; Minimal Involutive Bases. Ibid. pp. 543\u2013560. arXiv:math.AC\/9912029.","journal-title":"Math. Comput. Simulation"},{"key":"2004_CR8","first-page":"249","volume-title":"Proc. of the Conf. \u201cComputer Algebra in Scientific Computing\u201d (CASC\u201901)","author":"V.P. Gerdt","year":"2001","unstructured":"Gerdt, V.P., Blinkov, Yu.A., and Yanovich, D.A., Construction of Janet Bases: I. Monomial Bases and II. Polynomial Bases, Proc. of the Conf. \u201cComputer Algebra in Scientific Computing\u201d (CASC\u201901), (2001), Ganzha, V.G., Mayr, E.W., and Vorozhtsov, E.V., Eds., Berlin: Springer, 2001, pp. 249\u2013263."},{"key":"2004_CR9","first-page":"199","volume-title":"Computational Commutative and Non-Commutative Algebraic Geometry","author":"V.P. Gerdt","year":"2005","unstructured":"Gerdt, V.P., Involutive Algorithms for Computing Gr\u00f6bner Bases, Computational Commutative and Non-Commutative Algebraic Geometry, Cojocaru, S., Pfister, G., and Ufnarovski, V., Eds., Amsterdam: IOS, 2005, pp. 199\u2013225. arXiv:math.AC\/0501111."},{"key":"2004_CR10","doi-asserted-by":"crossref","unstructured":"Gerdt, V.P. and Zinin, M.V., A Pommaret Division Algorithm for Computing Gr\u00f6bner Bases in Boolean Rings, Proc. of ISSAC 2008 (RISC), Hagenberg, 2008. To appear.","DOI":"10.1145\/1390768.1390784"},{"issue":"s.4\u20135","key":"2004_CR11","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1016\/j.jsc.2004.04.004","volume":"40","author":"J. Apel","year":"2005","unstructured":"Apel, J. and Hemmecke, R., Detecting Unnecessary Reductions in an Involutive Basis Computation, J. Symbolic Computation, 2005, vol. 40, nos. 4\u20135, pp. 1131\u20131149.","journal-title":"J. Symbolic Computation"},{"key":"2004_CR12","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-94-009-5225-6_6","volume-title":"Recent Trends in Multidimensional System Theory","author":"B. Buchberger","year":"1985","unstructured":"Buchberger, B., Gr\u00f6bner Bases: An Algorithmic Method in Polynomial Ideal Theory, Recent Trends in Multidimensional System Theory, Bose, N.K., Ed., Dordrecht: Reidel, 1985, pp. 184\u2013232."},{"key":"2004_CR13","doi-asserted-by":"crossref","unstructured":"Gerdt, V.P. and Yanovich, D.A., Effectiveness of Involutive Criteria in Computation of Polynomial Janet Bases, Programmirovanie, 2006, no. 3, pp. 17\u201321 [Programming Comput. Software (Engl. Transl.), 2006, vol. 32, no. 3, pp. 134\u2013138].","DOI":"10.1134\/S0361768806030030"},{"key":"2004_CR14","volume-title":"Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"D. Cox","year":"1998","unstructured":"Cox, D., Little, J., and O\u2019shea, D., Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, New York: Springer, 1998. Translated under the title Idealy, mnogoobraziya i algoritmy, Moscow: Mir, 2000."},{"key":"2004_CR15","unstructured":"http:\/\/www-sop.inria.fr\/saga\/POL; http:\/\/www.math.uic.edu\/:_jan\/demo.html."},{"key":"2004_CR16","first-page":"272","volume":"3718","author":"V.V. Kornyak","year":"2005","unstructured":"Kornyak, V.V., On Compatibility of Discrete Relations, LNCS, Springer, 2005, vol. 3718, pp. 272\u2013284, arXiv:math-ph\/0504048.","journal-title":"LNCS"},{"key":"2004_CR17","first-page":"261","volume-title":"Lecture Notes in Computer Science","author":"A. Semenov","year":"2006","unstructured":"Semenov, A., On Connection between Constructive Involutive Divisions and Monomial Orderings, Lecture Notes in Computer Science, Berlin: Springer, 2006, vol. 4194, pp. 261\u2013278."},{"issue":"5","key":"2004_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jsco.1995.1026","volume":"19","author":"J. Apel","year":"1995","unstructured":"Apel, J., A Gr\u00f6bner Approach to Involutive Bases, J. Symbolic Computation, 1995, vol. 19, no. 5, pp. 441\u2013458.","journal-title":"J. Symbolic Computation"},{"key":"2004_CR19","volume-title":"Graduate Texts in Mathematics","author":"T. Becker","year":"1993","unstructured":"Becker, T., Weispfenning, V., and Kredel, H., Gr\u00f6bner Bases. A Computational Approach to Commutative Algebra, Graduate Texts in Mathematics, vol. 141, New York: Springer, 1993."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768809020042.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768809020042","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768809020042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768809020042.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:02:49Z","timestamp":1775008969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768809020042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["2004"],"URL":"https:\/\/doi.org\/10.1134\/s0361768809020042","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]},"assertion":[{"value":"1 June 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2009","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}