On the NP-completeness of cryptarithms

David Epstein. On the NP-completeness of cryptarithms. SIGACT News, 18(3):38-40, 1987. [doi]

Abstract

Abstract is missing.