A strongly polynomial algorithm for solving two-sided linear systems in max-algebra (Q2489939): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2005.09.008 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4304869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(A \otimes x = B \otimes y\) over \((\max,+)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and combinatorial optimization in ordered algebraic structures / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2005.09.008 / rank
 
Normal rank

Latest revision as of 23:47, 18 December 2024

scientific article
Language Label Description Also known as
English
A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
scientific article

    Statements

    A strongly polynomial algorithm for solving two-sided linear systems in max-algebra (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Max-algebra
    0 references
    Two-sided equation
    0 references
    Strongly polynomial algorithm
    0 references

    Identifiers