On the NP-completeness of cryptarithms

@article{Epstein1987OnTN,
  title={On the NP-completeness of cryptarithms},
  author={Dick Epstein},
  journal={SIGACT News},
  year={1987},
  volume={18},
  pages={38-40}
}
  • D. Epstein
  • Published 1 April 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… Expand
View on ACM
ics.uci.edu
21 Citations
Highly Influential Citations
1
Background Citations
11

21 Citations

Citation Type

Citation Type

Enumeration of Cryptarithms Using Deterministic Finite Automata
TLDR
The method to construct a DFA that accepts cryptarithms that admit (unique) solutions for each base is implemented and a D FA for bases \(k \le 7\) is constructed. Expand
Enumerating Cryptarithms Using Deterministic Finite Automata
TLDR
The method to construct a DFA that accepts cryptarithms that admit (unique) solutions for each base is implemented and a D FA for bases $k \le 7$ is constructed. Expand
NP-completeness of Arithmetical Restorations
TLDR
The NP-completeness of a problem deciding whether a given instance of arithmetical restorations of multiplication sums has a solution or not is shown. Expand
Complexity and Completeness of Finding Another Solution and Its Application to Puzzles
  • T. Yato, Takahiro Seta
  • Computer Science, Mathematics
  • IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
  • 2003
TLDR
This paper considers n-ASP, the problem to find another solution when n solutions are given, and considers ASP-completeness, the completeness with respect to the parsimonious reductions which allow polynomial-time transformation. Expand
On Reconfiguration Problems: Structure and Tractability
Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a path and computing the length of the shortest path between s and t are two of the most fundamental graph… Expand
Games, puzzles and computation
TLDR
This thesis develops the idea of game as computation to a greater degree than has been done previously, and presents a general family of games, called Constraint Logic, which is both mathematically simple and ideally suited for reductions to many actual board games. Expand
A Survey of NP-Complete Puzzles
TLDR
This article surveys NP-Complete puzzles in the hope of motivating further research in this fascinating area, particularly for those puzzles which have received little scientific attention to date. Expand
Cryptarithms: A Non-Programming Approach Using Excel
TLDR
This paper presents a method for solving cryptarithms using Microsoft Excel along with the Solver add-in, and introduces users of Excel to the often neglected integer and alldifferent constraints, as well as the increase in computational time associated with these constraints. Expand
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
TLDR
Background in combinatorial game theory is reviewed, which analyzes ideal play in perfect-information games and results about the complexity of determining ideal play are surveyed, in terms of both polynomial-time algorithms and computational intractability results. Expand
Experience with a New Distributed Termination Detection Algorithm
TLDR
The constraint based puzzle-solving method is explained, several test cases are reported, and preliminary experimental results show that far less control messages than indicated by the worst case behavior are usually generated. Expand
...
1
2
3
...

References

SHOWING 1-6 OF 6 REFERENCES
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge… Expand
Artificial Intelligence
TLDR
The history, the major landmarks, and some of the controversies in each of these twelve topics are discussed, as well as some predictions about the course of future research. Expand
Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran
Computers and Intractibility : A Guide to the Theory o f NP-Completeness
  • Computers and Intractibility : A Guide to the Theory o f NP-Completeness
  • 1979
Madachy's Mathematical Recreations
Report Inst
  • Theory of Numbers, University of Colorado, Boulder
  • 1959