Content deleted Content added
Devpro1981 (talk | contribs) No edit summary |
Question: Why does the "Recursion" section of the planned chapter 8 outline |
||
Line 177:
If fascicle 5 indeed already released, the article needs to be updated in several places... <!-- Template:Unsigned IP --><small class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/5.150.92.130|5.150.92.130]] ([[User talk:5.150.92.130#top|talk]]) 14:38, 2 December 2019 (UTC)</small> <!--Autosigned by SineBot-->
== Why associate Chaper 22 of "Selected Papers on Design of Algorithms" with "Recursion" ? ==
The current chapter outline says: "Chapter 8 – Recursion (chapter 22 of "Selected Papers on Analysis of Algorithms")"
I'm looking right now at Chapter 22 of "Selected Papers on Design of Algorithms", which is a reprint of "Semi-Optimal Bases for Linear Dependencies", originally published in Linear and Multilinear Algebra 17 (1985). It is a four page paper, with the following abstract (https://www.tandfonline.com/doi/abs/10.1080/03081088508817636?journalCode=glma20):
> Let A be an m × n matrix of real or complex numbers, and let μ. be a given constant ≥ 1. If A has rank m, it is possible to choose m columns of A such that, if B is the m × m matrix formed by these m columns, all entries of B −1 A are less than or equal to μ in absolute value. Moreover, if μ > 1, it is possible to find m such columns in a number of steps that is polynomial in m and n and inversely proportional to log μ.
The word "recursion" does not occur in the text of chapter 22. The book *does* list five entries for "recursion" in the index, but none of them are associated with chapter 22.
Therefore: Was this change in error? https://en.wikipedia.org/w/index.php?title=The_Art_of_Computer_Programming&diff=prev&oldid=875169161
[[User:Pnkfelix|Pnkfelix]] ([[User talk:Pnkfelix|talk]]) 13:59, 9 November 2022 (UTC)
| |||