Dynamic matrix rank
From MaRDI portal
Publication:843102
DOI10.1016/j.tcs.2009.06.012zbMath1176.65052OpenAlexW1998812252MaRDI QIDQ843102
Peter Frands Frandsen, Gudmund Skovbjerg Frandsen
Publication date: 29 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.012
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Reachability is in DynFO ⋮ Dynamic normal forms and dynamic characteristic polynomial ⋮ Dynamic matrix rank with partial lookahead
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The design of dynamic data structures
- Matrix multiplication via arithmetic progressions
- Fast algorithms for the characteristic polynomial
- Fast rectangular matrix multiplication and applications
- Maximum rank matrix completion
- Lower bounds for dynamic algebraic problems
- Unitäre Transformationen großer Matrizen
- Dynamic matrix rank with partial lookahead
- Dynamic Normal Forms and Dynamic Characteristic Polynomial
- Algebraic Graph Algorithms
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
This page was built for publication: Dynamic matrix rank
