Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal
From MaRDI portal
Publication:6641147
DOI10.1134/S0361768824020142MaRDI QIDQ6641147
A. V. Seliverstov, O. A. Zverkov
Publication date: 20 November 2024
Published in: Programming and Computer Software (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Vector spaces, linear dependence, rank, lineability (15A03) Linear equations (linear algebraic aspects) (15A06)
Cites Work
- Title not available (Why is that?)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- On the number of solutions to a system of Boolean equations
- Newton polytopes of nondegenerate quadratic forms
- Finitely generated structures computable in polynomial time
- On the number of solutions to linear Diophantine equation and Frobenius problem
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Solving low-density multiple subset sum problems with SVP oracle
- Binary solutions to large systems of linear equations
- Fast matrix rank algorithms and applications
- Real normal form of a binary polynomial at a second-order critical point
- Generalization of the subset sum problem and cubic forms
- Analytical study of cubature formulas on a sphere in computer algebra systems
- Unitals in projective planes of order 25
- On ranks of matrices over noncommutative domains
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity
This page was built for publication: Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641147)
