SAC 1997 Symposium on Applied Computing
 |  |
Wall of Fame | Most Viewed SAC-1997 Paper
SAC
1997
ACM
13 years 10 months ago
1997
ACM
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...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 249 | ||
| 2 | | 220 | ||
| 3 | | 128 | ||
| 4 | | 120 | ||
| 5 | | 118 | ||
| 6 | | 116 | ||
| 7 | | 109 | ||
| 8 | | 108 | ||
| 9 | | 99 |