1. Blass, A., Gurevich, Y.: On the unique satisfiability problem. Information and Control 55(1-3), 80–88 (1982)
2. Friedman, E.: Corral puzzles are NP-complete. Technical report, Stetson University, DeLand, FL 32723 (2002)
3. Friedman, E.: Pearl puzzles are NP-complete. Technical report, Stetson University, DeLand, FL 32723 (2002)
4. Friedman, E.: Spiral galaxies puzzles are NP-complete. Technical report, Stetson University, DeLand, FL 32723 (2002)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York, NY, USA (1990)