A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (<i>max</i>, +) (Q2938337)
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 cubic time algorithm for finding the principal solution to Sylvester matrix equations over (max, +) |
scientific article; zbMATH DE number 6386377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (<i>max</i>, +) |
scientific article; zbMATH DE number 6386377 |
Statements
A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (<i>max</i>, +) (English)
0 references
14 January 2015
0 references
max-plus algebra
0 references
principal solution
0 references
Sylvester matrix equation
0 references
tensor product
0 references
algorithm
0 references
0.8743208
0 references
0.86296546
0 references
0.85617924
0 references
0.8550313
0 references
0.8502477
0 references
0.8485101
0 references
0.8468136
0 references
