ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
R-by-C Crozzle: an NP-hard problem
Full text PdfPdf (372 KB)
Source Symposium on Applied Computing archive
Proceedings of the 1996 ACM symposium on Applied Computing table of contents
Philadelphia, Pennsylvania, United States
Pages: 73 - 76  
Year of Publication: 1996
ISBN:0-89791-820-7
Authors
Michelle Gower  Department of Computer Science, University of Missouri-Rolla
Ralph Wilkerson  Department of Computer Science, University of Missouri-Rolla
Sponsors
SIGBIO: ACM Special Interest Group on Biomedical Computing
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGICE: ACM Special Interest Group on Individual Computing Environment
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 7,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/331119.331148
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
 
2
Harris G.H., Forster J.J.H., "Automation of the Crozzle", Australian Computer Journal, 25, 2,1993, pp. 41-48.
 
3
Richard Patrick Rankin, Considerations for rapidly converging genetic algorithms designed for application to problems with expensive evaluation functions, University of Missouri/Rolla, Rolla, MO, 1993

CITED BY
David W. Binkley , Bradly M. Kuhn, Crozzle: an NP-complete problem, Proceedings of the 1997 ACM symposium on Applied computing, p.30-34, April 1997, San Jose, California, United States

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.1 Applications and Expert Systems
          Subjects: Games


General Terms:
Algorithms, Design, Performance, Theory


Keywords:
Crozzle, NP-hard, complexity

Collaborative Colleagues:
Michelle Gower: colleagues
Ralph Wilkerson: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player