{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:36:24Z","timestamp":1775054184488,"version":"3.50.1"},"reference-count":27,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"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":[[2010,3]]},"DOI":"10.1134\/s0361768810020106","type":"journal-article","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T22:45:17Z","timestamp":1270853117000},"page":"117-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On computation of Boolean involutive bases"],"prefix":"10.1134","volume":"36","author":[{"given":"V. P.","family":"Gerdt","sequence":"first","affiliation":[]},{"given":"M. V.","family":"Zinin","sequence":"additional","affiliation":[]},{"given":"Yu. A.","family":"Blinkov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2010,4,11]]},"reference":[{"key":"6064_CR1","unstructured":"Sakai, K. and Sato, Y., Boolean Gr\u00f6bner Bases, ICOT Tech. Memorandum 448, 1988. Sakai, K., Sato, Y., and Menju, S., Boolean Gr\u00f6bner Bases (Revised), ICOT Tech. Report 613, 1991. http:\/\/www.icot.or.jp\/ARCHIVE\/Museum\/TRTM\/tr-list-E.html."},{"key":"6064_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-45146-4_3","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, Lecture Notes in Computer Science, Springer, 2003, vol. 2729, pp. 44\u201360.","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"6064_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J.-C. Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J.-C., Gianni, P., Lazard, D., and Mora, T., Efficient Computation of Zero-Dimensional Gr\u00f6bner Bases by Change of Ordering, J. Symbol. Computations, 1993, vol. 16, no. 4, pp. 329\u2013344.","journal-title":"J. Symbol. Computations"},{"key":"6064_CR4","volume-title":"Modern Computer Algebra","author":"J. von zur Ghaten","year":"2003","unstructured":"von zur Ghaten, J. and Gerhard, J., Modern Computer Algebra, Cambridge: Cambridge Univ. Press, 2003, 2nd edition.","edition":"2nd edition"},{"issue":"6","key":"6064_CR5","first-page":"186","volume":"20","author":"A.L. Chistov","year":"2008","unstructured":"Chistov, A.L., Two Times Exponential Lower Bound on the Degree of System of Generators for a Polynomial Prime Ideal, Algebra I Analiz, 2008, vol. 20, no. 6, pp. 186\u2013213.","journal-title":"Algebra I Analiz"},{"key":"6064_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, New York: Freeman, 1978. Translated under the title Vychislitel\u2019nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982."},{"key":"6064_CR7","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H., Computational Complexity, Reading, Mass.: Addison-Wesley, 1994."},{"key":"6064_CR8","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}_2 \n$$ with Solutions in $$\n\\mathbb{F}_2 \n$$, INRIA report RR-5049, 2003."},{"key":"6064_CR9","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-540-71209-1_48","volume":"4424","author":"C. Condrat","year":"2007","unstructured":"Condrat, C. and Kalla, P., A Gr\u00f6bner Basis Approach to CNF-Formulae Preprocessing. Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, Springer, 2007, vol. 4424, pp. 618\u2013631.","journal-title":"Lecture Notes in Computer Science"},{"key":"6064_CR10","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":"6064_CR11","unstructured":"Gerdt, V.P. and Zinin, M.V., Involutive Method for Computing Gr\u00f6bner Bases over F\n                           2, Programmirovanie, 2008, no. 4, pp. 8\u201324 [Programming Comput. Software (Engl. Transl.), 2008, vol. 34, no. 4, pp. 112\u2013123]."},{"key":"6064_CR12","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 (Hagenberg, 2008), ACM, 2008, pp. 191\u2013203.","DOI":"10.1145\/1390768.1390784"},{"key":"6064_CR13","first-page":"495","volume":"35","author":"Q.-N. Tran","year":"2008","unstructured":"Tran, Q.-N., A P-SPACE Algorithm for Gr\u00f6bner Bases Computation in Boolean Rings, PWASET, 2008, vol. 35, pp. 495\u2013501.","journal-title":"PWASET"},{"key":"6064_CR14","first-page":"334","volume":"5081","author":"Y. Sato","year":"2008","unstructured":"Sato, Y., Nagai, A., and Inoue, S., On the Computation of Elimination Ideals of Boolean Polynomial Rings, Lecture Notes in Artificial Intelligence, Springer, 2008, vol. 5081, pp. 334\u2013348.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"6064_CR15","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":"6064_CR16","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":"6064_CR17","unstructured":"Dawson, C.M., Haselgrove, H.L., Hines, A.P., Mortimer, D., Nielsen, M.A., and Osborne, T.J., Quantum Computing and Polynomial Equations over the Finite Field Z2. arXiv:quant-ph\/0408129."},{"key":"6064_CR18","unstructured":"Seiler, W.M., A Combinatorial Approach to Involution and Delta-Regularity I: Involutive Bases in Polynomial Algebras of Solvable Type; II: Structure Analysis of Polynomial Modules with Pommaret Bases, Preprints of Universit\u00e4t Kassel, 2007."},{"key":"6064_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00013-004-1282-x","volume":"84","author":"W. Plesken","year":"2005","unstructured":"Plesken, W. and Robertz, D., Janet\u2019s Approach to Presentations and Resolutions for Polynomials and Linear Pdes, Arch. Math., 2005, vol. 84, pp. 22\u201337.","journal-title":"Arch. Math."},{"key":"6064_CR20","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."},{"key":"6064_CR21","first-page":"164","volume-title":"Proc. of Conf. \u201cComputer Algebra in Scientific Computing\u201d (CASC 2000)","author":"V.P. Gerdt","year":"2000","unstructured":"Gerdt, V.P., On the Relation between Pommaret and Janet Bases, Proc. of Conf. \u201cComputer Algebra in Scientific Computing\u201d (CASC 2000), (2000), Berlin: Springer, 2000, pp. 164\u2013171. arXiv:math.AC\/0004100."},{"key":"6064_CR22","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1006\/jsco.1997.0194","volume":"25","author":"J. Apel","year":"1998","unstructured":"Apel, J., Theory of Involutive Division and an Application to Hilbert Function, J. Symb. Computations, 1998, vol. 25, pp. 683\u2013704.","journal-title":"J. Symb. Computations"},{"key":"6064_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties, and Algorithms","author":"D. Cox","year":"2007","unstructured":"Cox, D., Little, J., and O\u2019shea, D., Ideals, Varieties, and Algorithms, New York: Springer, 2007, 3d edition.","edition":"3d edition"},{"key":"6064_CR24","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":"6064_CR25","doi-asserted-by":"crossref","unstructured":"Gerdt, V.P. and Blinkov, Yu.A., Specialized Computer Algebra System GINV, Programmirovanie, 2008, no. 2, pp. 67\u201380 [Programming Comput. Software (Engl. Transl.), 2008, vol. 34, no. 2, pp. 112\u2013123].","DOI":"10.1134\/S0361768808020096"},{"key":"6064_CR26","unstructured":"http:\/\/www-sop.inria.fr\/saga\/POL; http:\/\/www.math. uic.edu\/~jan\/demo.html."},{"key":"6064_CR27","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/11555964_23","volume":"3718","author":"V.V. Kornyak","year":"2005","unstructured":"Kornyak, V.V., On Compatibility of Discrete Relations, Lecture Notes in Computer Science, Springer, 2005, vol. 3718, pp. 272\u2013284, arXiv:math-ph\/0504048.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810020106.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768810020106","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810020106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810020106.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:09:32Z","timestamp":1775009372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768810020106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["6064"],"URL":"https:\/\/doi.org\/10.1134\/s0361768810020106","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]},"assertion":[{"value":"15 August 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2010","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}