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
Crozzle: an NP-complete problem
Full text PdfPdf (280 KB)
Source Symposium on Applied Computing archive
Proceedings of the 1997 ACM symposium on Applied computing table of contents
San Jose, California, United States
Pages: 30 - 34  
Year of Publication: 1997
ISBN:0-89791-850-9
Authors
David W. Binkley  Computer Science Department, Loyola College, 4501 N. Charles Street, Baltimore, Maryland
Bradly M. Kuhn
Sponsors
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 11,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

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/331697.331705
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
H. Corman, C. Leiserson, and R. Rivest. Algorithms. Mc- Graw Hill, New York, 1991.
2
Michelle Gower , Ralph Wilkerson, R-by-C Crozzle: an NP-hard problem, Proceedings of the 1996 ACM symposium on Applied Computing, p.73-76, February 17-19, 1996, Philadelphia, Pennsylvania, United States  [doi>10.1145/331119.331148]
 
3
G. Harris and J. Foster. Automation of the crozzle. In Austrialian Computer Journal, volume 25(2), pages 41-48, 1993.
 
4
Harry R. Lewis , Christos H. Papadimitriou , Christos Papadimitriou, Elements of the Theory of Computation, Prentice Hall PTR, Upper Saddle River, NJ, 1997
 
5
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

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.3 Complexity Measures and Classes
          Subjects: Reducibility and completeness

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS


General Terms:
Algorithms, Design, Languages, Performance, Theory


Keywords:
NP-complete, complexity, crozzle

Collaborative Colleagues:
David W. Binkley: colleagues
Bradly M. Kuhn: colleagues

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