2000 character limit reached
On some bounds for symmetric tensor rank of multiplication in finite fields
Published 2 Jan 2016 in cs.IT and math.IT | (1601.00126v2)
Abstract: We establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover we give examples of Shimura curves that do not descend over their field of moduli, which discusses the validity of certain published bounds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.