The Art of Computer Programming, vol. 4, fascicle 2: Generating All Tuples and Permutations
Donald Ervin Knuth
Addison-Wesley
,
2005
Cites:
On the NP-completeness of cryptarithms
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine