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:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!