On sets of linear forms of maximal complexity

Autor:	Kaminski, Michael, Shparlinski, Igor E., Waldschmidt, Michel
Rok vydání:	2021
Předmět:	Computer Science - Computational Complexity Mathematics - Number Theory
Zdroj:	Computational Complexity, Vol.32, (2023), Article 1
Druh dokumentu:	Working Paper
DOI:	10.1007/s00037-022-00234-5
Popis:	We present a uniform description of sets of $m$ linear forms in $n$ variables over the field of rational numbers whose computation requires $m(n - 1)$ additions.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2110.04657 Zobrazit plný text záznamu View this record from Arxiv