Código QR (código de barras bidimensional)

Algebraic complexities and algebraic curves over finite fields

We consider the problem of minimal (multiplicative) complexity of polynomial multiplication and multiplication in finite extensions of fields. For infinite fields minimal complexities are known [Winograd, S. (1977) Math. Syst. Theory 10, 169-180]. We prove lower and upper bounds on minimal complexit...

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Udgivet i:Proc Natl Acad Sci U S A
Principais autores: Chudnovsky, D. V., Chudnovsky, G. V.
Format: Artigo
Sprog:Inglês
Udgivet: National Academy of Sciences 1987
Fag:
Online adgang:https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC304516/
https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/16593816/
https://ncbi.nlm.nih.govhttps://doi.org/10.1073/pnas.84.7.1739
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!