On the NP-completeness of cryptarithms
@article{Epstein1987OnTN,
title={On the NP-completeness of cryptarithms},
author={D. Epstein},
journal={Sigact News},
year={1987},
volume={18},
pages={38-40}
}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 the 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 many different letters (up to the base of representation). The… CONTINUE READING
Topics from this paper
20 Citations
Enumeration of Cryptarithms Using Deterministic Finite Automata
- Mathematics, Computer Science
- CIAA
- 2018
- 1
Enumerating Cryptarithms Using Deterministic Finite Automata
- Mathematics, Computer Science
- ArXiv
- 2018
- Highly Influenced
- PDF
Complexity and Completeness of Finding Another Solution and Its Application to Puzzles
- Mathematics
- 2003
- 244
- PDF
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
- Computer Science, Mathematics
- MFCS
- 2001
- 200
- PDF