Selected papers that cite this one
- Eric Goles and Iván Rapaport. Complexity of tile rotation problems. Theoretical Computer Science, 188(1-2):129-159, 30 November 1997.
- Edith Hemaspaandra. The price of universality. Notre Dame Journal of Formal Logic, 37(2):174-203, Spring 1996.
- Tirza Hirst and David Harel. Taking it to the limit: On infinite variants of NP-complete problems. Journal of Computer and System Sciences, 53(2):180-193, October 1996.