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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter Butkovic / rank
Normal rank
 
Property / author
 
Property / author: Peter Butkovic / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157261308 / 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

Latest revision as of 13: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
    0 references
    0 references
    0 references
    0 references
    Max-algebra
    0 references
    Two-sided equation
    0 references
    Strongly polynomial algorithm
    0 references
    0 references