On the NP-completeness of cryptarithms

@inproceedings{Epstein1987OnTN,
  title={On the NP-completeness of cryptarithms},
  author={David Epstein},
  booktitle={SIGA},
  year={1987}
}

• David Epstein
• Published 1987 in SIGA
• DOI:10.1145/24658.24662

If we only consider problems with decimal numbers as above there is no possibility of any hardness result , because there are only 10! different assignments of digits and letters to try . Therefore we will generalize th e problem slightly : the base of representation for our numbers will be given as part of the problem (expressed in unary or binary) rather than always being decimal, and we will allow the puzzle to contain arbitrarily man y different letters (up to the base of representation… CONTINUE READING

View on ACM

Add to Library

Create Alert

Cite