On the NP-completeness of cryptarithms

David Eppstein
SIGACT News 18(3):38–40, 1987
http://www.ics.uci.edu/~eppstein/pubs/Epp-SN-87.pdf

Cited by:

• Experience with a new distributed termination detection algorithm
• Playing games with algorithms: algorithmic combinatorial game theory
• The Complexities of Puzzles, Cross Sum and their Another Solution Problems (ASP)
• Complexity and Completeness of Finding Another Solution and its Application to Puzzles
• The Art of Computer Programming, vol. 4, fascicle 2: Generating All Tuples and Permutations