Content deleted Content added
Peter Buch (talk | contribs) →Example: Describe the last reduction of the matrix in analogy to the previous reductions. |
→Example: Fixed typo Tags: Mobile edit Mobile web edit |
||
| (2 intermediate revisions by one other user not shown) | |||
Line 7:
Algorithm X works as follows:
# If the matrix ''A'' has no columns, the current partial solution is a valid solution; terminate successfully.
# Otherwise choose a column ''c'' ([[deterministic algorithm|deterministically]]).
Line 17 ⟶ 16:
#: delete column ''j'' from matrix ''A''.
# Repeat this algorithm recursively on the reduced matrix ''A''.
The nondeterministic choice of ''r'' means that the algorithm recurses over independent subalgorithms; each subalgorithm inherits the current matrix ''A'', but reduces it with respect to a different row ''r''.
Line 306 ⟶ 305:
:::{| class="wikitable"
! !! <span style="color:red">
|-
! ''F''
Line 346 ⟶ 345:
::: Step 1—The matrix is empty, thus this branch of the algorithm terminates successfully.
::: As rows ''B'', ''D'', and ''F'' have been
::::{| class="wikitable"
| |||