Effective lower bounds on the matrix rank and their applications
From MaRDI portal
Publication:6535147
DOI10.1134/S0361768823020160zbMATH Open1543.68474MaRDI QIDQ6535147
A. V. Seliverstov, O. A. Zverkov
Publication date: 10 November 2023
Published in: Programming and Computer Software (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fields of algebraic numbers computable in polynomial time. I
- On symmetric and skew-symmetric determinantal varieties
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- (0,1)-matrices with minimal permanents
- Heuristic algorithms for recognition of some cubic hypersurfaces
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- Affine subspaces of matrices with constant rank
- Supercomputer environment for recursive matrix algorithms
- Fields of algebraic numbers computable in polynomial time. II
- A modular extension for a computer algebra system
- On nonsingularity of circulant matrices
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Solving low-density multiple subset sum problems with SVP oracle
- Calculation of the characteristic polynomial of a matrix
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Binary solutions to large systems of linear equations
- Generic complexity of the membership problem for semigroups of integer matrices
- Fast matrix rank algorithms and applications
- Efficient algorithms for computing the characteristic polynomial in a domain
This page was built for publication: Effective lower bounds on the matrix rank and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535147)
