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}
}
  • D. Epstein
  • Published 1987
  • Computer Science
  • Sigact News
  • 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
    20 Citations

    Topics from this paper

    Enumerating Cryptarithms Using Deterministic Finite Automata
    • Highly Influenced
    • PDF
    NP-completeness of Arithmetical Restorations
    • T. Matsui
    • Computer Science
    • J. Inf. Process.
    • 2013
    • 1
    • PDF
    On Reconfiguration Problems: Structure and Tractability
    • 7
    Games, puzzles and computation
    • 170
    • PDF
    A Survey of NP-Complete Puzzles
    • 137
    • PDF
    Cryptarithms: A Non-Programming Approach Using Excel
    • 2
    Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
    • 200
    • PDF
    Experience with a New Distributed Termination Detection Algorithm
    • 21
    • PDF