A cost-scaling algorithm for computing the degree of determinants (Q2159472)
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: A cost-scaling algorithm for computing the degree of determinants |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cost-scaling algorithm for computing the degree of determinants |
scientific article |
Statements
A cost-scaling algorithm for computing the degree of determinants (English)
0 references
1 August 2022
0 references
edmonds' problem
0 references
noncommutative rank
0 references
Dieudonné determinant
0 references
Newton polytope
0 references
partitioned matrix
0 references
0 references
0 references
0 references
0 references
0 references
0.8767013549804688
0 references
0.7920758128166199
0 references
0.7918727993965149
0 references
0.7818043231964111
0 references
0.7771744132041931
0 references
