Lower Bounds for the Rank of a Matrix with Zeros and Ones outside the Leading Diagonal
-
Published:2024-04
Issue:2
Volume:50
Page:202-207
-
ISSN:0361-7688
-
Container-title:Programming and Computer Software
-
language:en
-
Short-container-title:Program Comput Soft
Author:
Seliverstov A. V.ORCID, Zverkov O. A.ORCID
Publisher
Pleiades Publishing Ltd
Reference20 articles.
1. Alaev, P.E., Finitely generated structures computable in polynomial time, Sib. Math. J., 2022, vol. 63, pp. 801–818. https://doi.org/10.1134/S0037446622050019 2. Leontiev, V.K. and Gordeev, E.N., On the number of solutions to a system of Boolean equations, Autom. Remote Control, 2021, vol. 82, pp. 1581–1596.
https://doi.org/10.1134/S000511792109006X 3. Gordeev, E.N. and Leont’ev, V.K., On the number of solutions to linear Diophantine equation and Frobenius problem, Comput. Math. Math. Phys., 2022, vol. 62, pp. 1413–1423. https://doi.org/10.1134/S0965542522090044 4. Pan, Y. and Zhang, F., Solving low-density multiple subset sum problems with SVP oracle, J. Syst. Sci. Complexity, 2016, vol. 29, pp. 228–242. https://doi.org/10.1007/s11424-015-3324-9 5. Seliverstov, A.V., Binary solutions to large systems of linear equations, Prikl. Diskretnaya Mat., 2021, no. 52, pp. 5–15. https://doi.org/10.17223/20710410/52/1
|
|