Olga Kosheleva, Vladik Kreinovich, Günter Mayer, Hung T. Nguyen. Computing the cube of an interval matrix is NP-Hard. In Hisham Haddad, Lorie M. Liebrock, Andrea Omicini, Roger L. Wainwright, editors, Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005. pages 1449-1453, ACM, 2005. [doi]
@inproceedings{KoshelevaKMN05,
title = {Computing the cube of an interval matrix is NP-Hard},
author = {Olga Kosheleva and Vladik Kreinovich and Günter Mayer and Hung T. Nguyen},
year = {2005},
doi = {10.1145/1066677.1067007},
url = {http://doi.acm.org/10.1145/1066677.1067007},
researchr = {https://researchr.org/publication/KoshelevaKMN05},
cites = {0},
citedby = {0},
pages = {1449-1453},
booktitle = {Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005},
editor = {Hisham Haddad and Lorie M. Liebrock and Andrea Omicini and Roger L. Wainwright},
publisher = {ACM},
isbn = {1-58113-964-0},
}