Title of article :
Computing orbit period in max–min algebra Original Research Article
Author/Authors :
Martin Gavalec، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2000
Abstract :
Periodicity of vector orbits in max–min algebra is studied. It is proved that computing the coordinate-orbit period is NP-hard, while the orbit period can be computed in O(n4) time. A related problem of maximum sequence period is shown to be NP-complete.
Keywords :
Period of a matrix , Orbit of a vector , Max–min algebra , NP-completeness
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics