NP-completeness of Arithmetical Restorations

Abstract

This paper deals with a variation of crypt-arithmetics, called “arithmetical restorations.” Arithmetical restorations are problems dealing with the reconstruction of arithmetical sums from which various digits have been erased. We show the NP-completeness of a problem deciding whether a given instance of arithmetical restorations of multiplication sums has a solution or not.