Deterministic Polynomial Time Algorithms for Matrix Completion Problems (Q5390613)
From MaRDI portal
scientific article; zbMATH DE number 5874051
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic Polynomial Time Algorithms for Matrix Completion Problems |
scientific article; zbMATH DE number 5874051 |
Statements
Deterministic Polynomial Time Algorithms for Matrix Completion Problems (English)
0 references
4 April 2011
0 references
matrix completion
0 references
identity testing
0 references
modules
0 references
generators
0 references
morphisms
0 references
