Revision as of 23:22, 22 July 2006 edit Rob Zako (talk \| contribs) 328 edits Add "See also" section ← Previous edit		Revision as of 22:19, 13 September 2007 edit undo Chrisjohnson (talk \| contribs) 314 edits mNo edit summary Next edit →
Line 1: [[Donald Knuth\|Donald Knuth's]] '''Algorithm X''', first presented in November of 2000, is a [[recursion (computer science)\|recursive]], [[Nondeterministic_algorithm\|nondeterministic]], [[depth-first]], [[brute-force]] [[algorithm]] that finds all solutions to the [[exact cover]] problem represented by a matrix ''A'' consisting of 0s and 1s. The goal is to select a subset of the rows so that the digit 1 appears in each column exactly once.

Knuth's Algorithm X: Difference between revisions