On the NP-completeness of cryptarithms

  • Authors:

  • D Epstein

  • Affiliations:

  • Computer Science Department, Columbia University, New York, NY

  • Venue:
  • ACM SIGACT News
  • Year:
  • 1987

Quantified Score

Hi-index 0.01

Visualization

Abstract