Knuth–Eve algorithm: Difference between revisions

Revision as of 05:44, 27 July 2025

Revision as of 05:53, 27 July 2025

Line 52:

<div style="margin-left: 35px;">

{{framebox|blue}}

* Let <math>r_1, \cdots, r_n \in \mathbb{C}</math> be the complex roots of <math>p</math>, sorted in descending order by real part

* LetChoose any <math display="inline">t = \max_{i = 1}^ngeq \text{Re}(r_ir_2)</math>

* Set <math>p \gets p(x + t)</math>

<hr/>