Fast algorithms for solving equations of degree \(\le 4\) in some finite fields (Q2666933): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4312125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of algebraic equations over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on square roots in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulas for cube roots in \(\mathbb F_{3^m}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a quick multiplication in normal bases of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster integer multiplication using plain vanilla FFT primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster polynomial multiplication over finite fields using cyclotomic coefficient rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the method of additive chains to inversion in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of roots in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taking roots over high extensions of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in degree \(2^k\)-extensions of finite fields of odd characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Polynomial Factorization and Modular Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithm of square rooting in some finite fields of odd characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267461 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3103/s0027132221030049 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3201310957 / rank
 
Normal rank

Latest revision as of 09:43, 30 July 2024

scientific article
Language Label Description Also known as
English
Fast algorithms for solving equations of degree \(\le 4\) in some finite fields
scientific article

    Statements

    Fast algorithms for solving equations of degree \(\le 4\) in some finite fields (English)
    0 references
    23 November 2021
    0 references
    solving equations
    0 references
    bit complexity
    0 references
    tower of finite fields
    0 references
    standard and normal bases
    0 references
    0 references

    Identifiers