We determine the computational complexity of various choice models that use multiple rationales to explain observed choice behavior. First, we demonstrate that the notion of rationalizability by K rationales, introduced by Kalai et al. (2002), is NP-complete for K greater than or equal to two....