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( n 4) time. A related problem of maximum sequence period is shown to be NP-complete.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
