Up: Crozzle: an NP-Complete Problem Previous: SUMMARY

Bibliography

1
H. Corman, C. Leiserson, and R. Rivest.
Algorithms.
McGraw Hill, New York, 1991.

2
M. Gower and R. Wilkerson.
R-by-C crozzle: An NP-hard problem.
In Proceedings 1996 ACM Symposium on Applied Computing, pages 73-76, 1996.

3
G. Harris and J. Foster.
Automation of the crozzle.
In Austrialian Computer Journal, volume 25(2), pages 41-48, 1993.

4
H Lewis and C. Papadimitriou.
Elements of the Theory of Computation.
Prentice-Hall, Englewood Cliffs, New Jersey, 07632, 1981.

5
R. Rankin.
Considerations for Rapidly Converging Genetic Algorithms Designed for Applictions to Problems with Expensice Evaluations Functions.
PhD thesis, University of Missouri-Rolla, Rolla, Missouri, 1993.



Copyright © 1997 Bradley M. Kuhn, David W. Binkley.

Verbatim copying and distribution of this entire paper is permitted in any medium, provided this notice is preserved.