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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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

Latest revision as of 12:30, 24 June 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