Welcome to the resource topic for 2022/992
Title:
An \mathcal{O}(n) Algorithm for Coefficient Grouping
Authors: Fukang Liu
Abstract: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 technique.
ePrint: https://eprint.iacr.org/2022/992
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .