An $\mathcal{O}(n)$ Algorithm for Coefficient Grouping

ePrint Report: An $\mathcal{O}(n)$ Algorithm for Coefficient Grouping

Fukang Liu

In this note, we study a specific optimization problem arising in the recently proposed coefficient grouping technique, which is used for the degree evaluation. Specifically, we show that there exists an efficient algorithm running in time $\mathcal{O}(n)$ to solve a basic optimization problem relevant to upper bound the algebraic degree. We expect that some results in this note can inspire more studies on other optimization problems in the coefficient grouping …

algorithm eprint report