Content deleted Content added
articles are about concepts, not the names of concepts; concision; remove repeated links |
Tom.Reding (talk | contribs) m Enum 1 author/editor WL; WP:GenFixes on |
||
Line 1:
'''Algorithm X''' is an [[algorithm]] for solving the [[exact cover]] problem. It is a straightforward [[Recursion (computer science)|recursive]], [[Nondeterministic algorithm|nondeterministic]], [[depth-first]], [[backtracking]] algorithm used by [[Donald Knuth]] to demonstrate an efficient implementation called DLX, which uses the [[dancing links]] technique.<ref name="knuth">{{cite arXiv | author =
The exact cover problem is represented in Algorithm X by a matrix ''A'' consisting of 0s and 1s. The goal is to select a subset of the rows such that the digit 1 appears in each column exactly once.
Line 369:
{{Reflist}}
*{{citation
| first = Donald E. | last = Knuth |
| contribution = Dancing links
| title = Millennial Perspectives in Computer Science: Proceedings of the 1999 Oxford-Microsoft Symposium in Honour of Sir Tony Hoare
| |||