Finite field towers: Iterated presentation and complexity of arithmetic.
DOI10.1006/FFTA.2001.0337zbMATH Open1037.11088OpenAlexW2347133766MaRDI QIDQ1609402FDOQ1609402
Authors: Valentine B. Afanassiev, Alexander A. Davydov 
Publication date: 15 August 2002
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/ffta.2001.0337
Recommendations
- scientific article; zbMATH DE number 2154092
- scientific article; zbMATH DE number 1498779
- Complexity of Boolean schemes for arithmetic in some towers of finite fields
- On tame towers over finite fields
- scientific article; zbMATH DE number 1498780
- Recursive towers of function fields over finite fields
- Finite Fields and Applications
- scientific article; zbMATH DE number 2231485
- On number fields towers defined by iteration of polynomials
- Polynomial-time presentations of algebraic number fields
Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- Fast multiplication of large numbers
- Computational Complexity of Fourier Transforms Over Finite Fields
- Title not available (Why is that?)
- The explicit construction of irreducible polynomials over finite fields
- Title not available (Why is that?)
- Infinite Algebraic Extensions of Finite Fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Finite field towers: Iterated presentation and complexity of arithmetic.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609402)
