{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:38:36Z","timestamp":1775018316746,"version":"3.50.1"},"reference-count":27,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"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":[[2023,10]]},"DOI":"10.1134\/s0361768823020160","type":"journal-article","created":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T04:55:24Z","timestamp":1696827324000},"page":"441-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Effective Lower Bounds on the Matrix Rank and Their Applications"],"prefix":"10.1134","volume":"49","author":[{"given":"O. A.","family":"Zverkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. V.","family":"Seliverstov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2023,10,9]]},"reference":[{"key":"3758_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1134\/S036176882002005X","volume":"46","author":"M.N. Gevorkyan","year":"2020","unstructured":"Gevorkyan, M.N., Korolkova, A.V., Kulyabov, D.S., and Sevast\u2019yanov, L.A., A modular extension for a computer algebra system, Program. Comput. Software, 2020, vol. 46, no. 2, pp. 98\u2013104.","journal-title":"Program. Comput. Software"},{"key":"3758_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BFb0028792","volume":"199","author":"A.L. Chistov","year":"1985","unstructured":"Chistov, A.L., Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic, Lect. Notes Comput. Sci., 1985, vol. 199, pp. 63\u201369. https:\/\/doi.org\/10.1007\/BFb0028792","journal-title":"Lect. Notes Comput. Sci."},{"key":"3758_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, Combinatorica, 1987, vol. 7, no. 1, pp. 101\u2013104. https:\/\/doi.org\/10.1007\/BF02579205","journal-title":"Combinatorica"},{"key":"3758_CR4","doi-asserted-by":"publisher","DOI":"10.29003\/m2019.978-5-317-06623-9","volume-title":"About big matrix inversion, Comput. Algebra","author":"G. Malaschonok","year":"2021","unstructured":"Malaschonok, G. and Tchaikovsky, I., About big matrix inversion, Comput. Algebra, Abramov, S.A. and Sevastyanov, L.A., Eds., Moscow: MAKS Press, 2021, pp. 81\u201384. https:\/\/doi.org\/10.29003\/m2019.978-5-317-06623-9"},{"key":"3758_CR5","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1134\/S0361768822020086","volume":"48","author":"G.I. Malaschonok","year":"2022","unstructured":"Malaschonok, G.I. and Sidko, A.A., Supercomputer environment for recursive matrix algorithms, Program. Comput. Software, 2022, vol. 48, pp. 90\u2013101.","journal-title":"Program. Comput. Software"},{"key":"3758_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2528404","volume":"60","author":"H.Y. Cheung","year":"2013","unstructured":"Cheung, H.Y., Kwok, T.C., and Lau, L.C., Fast matrix rank algorithms and applications, J. ACM, 2013, vol.\u00a060, no. 5, pp. 1\u201325. https:\/\/doi.org\/10.1145\/2528404","journal-title":"J. ACM"},{"key":"3758_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0022-4049(99)00158-9","volume":"156","author":"J. Abdeljaoued","year":"2001","unstructured":"Abdeljaoued, J. and Malaschonok, G.I., Efficient algorithms for computing the characteristic polynomial in a domain, J. Pure Appl. Algebra, 2001, vol. 156, pp. 127\u2013145. https:\/\/doi.org\/10.1016\/S0022-4049(99)00158-9","journal-title":"J. Pure Appl. Algebra"},{"key":"3758_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1515\/dma.2011.008","volume":"21","author":"O.N. Pereslavtseva","year":"2011","unstructured":"Pereslavtseva, O.N., Calculation of the characteristic polynomial of a matrix, Discrete Math. Appl., 2011, vol.\u00a021, no. 1, pp. 109\u2013128.","journal-title":"Discrete Math. Appl."},{"key":"3758_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jco.2021.101572","volume":"67","author":"V. Neiger","year":"2021","unstructured":"Neiger, V. and Pernet, C., Deterministic computation of the characteristic polynomial in the time of matrix multiplication, J. Complexity, 2021, vol. 67, no. 101572, pp. 1\u201335. https:\/\/doi.org\/10.1016\/j.jco.2021.101572","journal-title":"J. Complexity"},{"key":"3758_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.laa.2020.12.010","volume":"612","author":"Z. Chen","year":"2021","unstructured":"Chen, Z., On nonsingularity of circulant matrices, Linear Algebra Appl., 2021, vol. 612, pp. 162\u2013176. https:\/\/doi.org\/10.1016\/j.laa.2020.12.010","journal-title":"Linear Algebra Appl."},{"key":"3758_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10469-020-09565-0","volume":"58","author":"P.E. Alaev","year":"2020","unstructured":"Alaev, P.E. and Selivanov, V.L., Fields of algebraic numbers computable in polynomial time. I, Algebra Logic, 2020, vol. 58, pp. 447\u2013469.","journal-title":"Algebra Logic"},{"key":"3758_CR12","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10469-022-09661-3","volume":"60","author":"P.E. Alaev","year":"2022","unstructured":"Alaev, P.E. and Selivanov, V.L., Fields of algebraic numbers computable in polynomial time. II, Algebra Logic, 2022, vol. 60, pp. 349\u2013359.","journal-title":"Algebra Logic"},{"key":"3758_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0040-9383(84)90026-0","volume":"23","author":"J. Harris","year":"1984","unstructured":"Harris, J. and Tu, L.W., On symmetric and skew-symmetric determinantal varieties, Topology, 1984, vol. 23, no. 1, pp. 71\u201384. https:\/\/doi.org\/10.1016\/0040-9383(84)90026-0","journal-title":"Topology"},{"key":"3758_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2189-8","volume-title":"Algebraic Geometry","author":"J. Harris","year":"1992","unstructured":"Harris, J., Algebraic Geometry, New York: Springer, 1992. https:\/\/doi.org\/10.1007\/978-1-4757-2189-8"},{"key":"3758_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.laa.2022.03.002","volume":"644","author":"E. Rubei","year":"2022","unstructured":"Rubei, E., Affine subspaces of matrices with constant rank, Linear Algebra Appl., 2022, vol. 644, no. 1, pp.\u00a0259\u2013269. https:\/\/doi.org\/10.1016\/j.laa.2022.03.002","journal-title":"Linear Algebra Appl."},{"key":"3758_CR16","doi-asserted-by":"publisher","unstructured":"Seliverstov, A.V., Binary solutions to large systems of linear equations, Prikl. Diskretnaya Mat., 2021, no. 52, pp. 5\u201315. https:\/\/doi.org\/10.17223\/20710410\/52\/1","DOI":"10.17223\/20710410\/52\/1"},{"key":"3758_CR17","first-page":"38","volume":"1","author":"N.N. Kuzyurin","year":"1994","unstructured":"Kuzyurin, N.N., Polynomial-average algorithm in integer linear programming, Sib. Zh. Issled. Oper., 1994, vol. 1, no. 3, pp. 38\u201348.","journal-title":"Sib. Zh. Issled. Oper."},{"key":"3758_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-1606-7","volume-title":"An integer linear programming algorithm polynomial in the average case, Discrete Analysis and Operations Research","author":"N.N. Kuzyurin","year":"1996","unstructured":"Kuzyurin, N.N., An integer linear programming algorithm polynomial in the average case, Discrete Analysis and Operations Research, Korshunov, A.D., Ed., Dordrecht: Springer, 1996, vol. 355, pp. 143\u2013152. https:\/\/doi.org\/10.1007\/978-94-009-1606-7"},{"key":"3758_CR19","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s11424-015-3324-9","volume":"29","author":"Y. Pan","year":"2016","unstructured":"Pan, Y. and Zhang, F., Solving low-density multiple subset sum problems with SVP oracle, J. Syst. Sci. Complexity, 2016, vol. 29, pp. 228\u2013242. https:\/\/doi.org\/10.1007\/s11424-015-3324-9","journal-title":"J. Syst. Sci. Complexity"},{"key":"3758_CR20","doi-asserted-by":"publisher","unstructured":"Rybalov, A.N., On the generic complexity of the subset sum problem for semigroups of integer matrices, Prikl. Diskretnaya Mat., 2020, no. 50, pp. 118\u2013126. https:\/\/doi.org\/10.17223\/20710410\/50\/9","DOI":"10.17223\/20710410\/50\/9"},{"key":"3758_CR21","doi-asserted-by":"publisher","unstructured":"Rybalov, A.N., On the generic complexity of the occurrence problem for semigroups of integer matrices, Prikl. Diskretnaya Mat., 2022, no. 55, pp. 95\u2013101. https:\/\/doi.org\/10.17223\/20710410\/55\/7","DOI":"10.17223\/20710410\/55\/7"},{"key":"3758_CR22","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1134\/S0361768821010096","volume":"47","author":"A.V. Seliverstov","year":"2021","unstructured":"Seliverstov, A.V., Heuristic algorithms for recognition of some cubic hypersurfaces, Program. Comput. Software, 2021, vol. 47, no. 1, pp. 50\u201355.","journal-title":"Program. Comput. Software"},{"key":"3758_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF02771770","volume":"15","author":"H. Minc","year":"1973","unstructured":"Minc, H., (0, 1)-matrices with minimal permanents, Isr. J. Math., 1973, vol. 15, pp. 27\u201330. https:\/\/doi.org\/10.1007\/BF02771770","journal-title":"Isr. J. Math."},{"key":"3758_CR24","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1134\/S1064226912080049","volume":"57","author":"A.V. Seliverstov","year":"2012","unstructured":"Seliverstov, A.V. and Lyubetsky, V.A., About forms equal to zero at each vertex of a cube, J. Commun. Technol. Electron., 2012, vol. 57, no. 8, pp. 892\u2013895. https:\/\/doi.org\/10.1134\/S1064226912080049","journal-title":"J. Commun. Technol. Electron."},{"key":"3758_CR25","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T., Fast probabilistic algorithms for verification of polynomial identities, J. ACM, 1980, vol. 27, no. 4, pp. 701\u2013717. https:\/\/doi.org\/10.1145\/322217.322225","journal-title":"J. ACM"},{"key":"3758_CR26","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"C.R. Harris","year":"2020","unstructured":"Harris, C.R., Millman, K.J., van der Walt, S.J., et al., Array programming with NumPy, Nature, 2020, vol.\u00a0585, no. 7825, pp. 357\u2013362. https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nature"},{"key":"3758_CR27","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s11424-020-0028-6","volume":"35","author":"Y.A. Chen","year":"2022","unstructured":"Chen, Y.A. and Gao, X.S., Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems, J. Syst. Sci. Complexity, 2022, vol. 35, pp. 373\u2013412. https:\/\/doi.org\/10.1007\/s11424-020-0028-6","journal-title":"J. Syst. Sci. Complexity"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823020160.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768823020160","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823020160.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:51:43Z","timestamp":1775011903000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768823020160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["3758"],"URL":"https:\/\/doi.org\/10.1134\/s0361768823020160","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10]]},"assertion":[{"value":"26 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}