SAC   1997 Symposium on Applied Computing
Wall of Fame | Most Viewed SAC-1997 Paper
13 years 11 months ago
Crozzle: an NP-complete problem
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
David Binkley, Bradley M. Kuhn
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source249
2Download preprint from source220
3Download preprint from source128
4Download preprint from source120
5Download preprint from source118
6Download preprint from source116
7Download preprint from source109
8Download preprint from source108
9Download preprint from source99