"On the NP-completeness of cryptarithms."

David Epstein (1987)

> Home

Details and statistics

DOI: 10.1145/24658.24662

access: closed

type: Journal Article

metadata version: 2021-07-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/sigact/Epstein87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigact/Epstein87
David Epstein:
On the NP-completeness of cryptarithms. SIGACT News 18(3): 38-40 (1987)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.