Fast deterministic algorithms for matrix completion problems (Q4979852)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast deterministic algorithms for matrix completion problems |
scientific article; zbMATH DE number 6305465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast deterministic algorithms for matrix completion problems |
scientific article; zbMATH DE number 6305465 |
Statements
Fast Deterministic Algorithms for Matrix Completion Problems (English)
0 references
19 June 2014
0 references
maximum rank completion
0 references
skew-symmetric matrix
0 references
network coding
0 references
algorithm
0 references
0.9168250560760498
0 references
0.8783213496208191
0 references
0.8456559181213379
0 references
0.8294240236282349
0 references
0.7722187042236328
0 references
