This paper will prove that a generalized version of the popular solitaire variant SpiderSolitaire is NP-Complete. This proof is very similar to section 4.3 of Malte Helmert’s Complexity results for standard benchmark domains in planning Artificial Intelligence 143 (2), pp. 219262. 2003, but is re-tailored to fit the game of SpiderSolitaire, rather the FreeCell. In order to determine the domain ...

We prove that computing the rank of a three-dimensional tensor over any nite eld is NP-complete. Over the rational numbers the problem is NP-hard. Warning: Essentially this paper has beenpublished in Journal of Algorithms and is hence subject to copyright restrictions. It is for personal use only. 1. Introduction. One of the most fundamental quantities in linear algebra is the rank of a matrix....

We show that it is NP-Complete to decide whether a bimatrix game is degenerate and it is Co-NP-Complete to decide whether a bimatrix game is nondegenerate.

We develop a general framework of rule based database update on the basis of prioritized logic programs. This approach has advantages in representing and handling information connict in updates. We then focus on the computational aspect of this approach. We show that under our framework, the model checking in an update is co-NP-complete, while the associated inference problem is P 2-complete. F...