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]
Abstract is missing.