On splitting sets in block designs and finding roots of polynomials (Q915734): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Factoring Polynomials Over Large Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Un Algorithme De Construction Des Idempotents Primitifs D'Ideaux D'Algebres Sur Fq / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Algorithm for Factorizing Polynomials of Fq [X] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Factoring Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Efficiency of Algorithms for Polynomial Factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Algorithms in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric approach to root finding in GT(q/sup m/) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclotomy and difference families in elementary Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conversion algorithm for logarithms on \(GF(2^n)\) / rank
 
Normal rank

Latest revision as of 09:41, 21 June 2024

scientific article
Language Label Description Also known as
English
On splitting sets in block designs and finding roots of polynomials
scientific article

    Statements

    On splitting sets in block designs and finding roots of polynomials (English)
    0 references
    1990
    0 references
    0 references
    factoring
    0 references
    t-splitting sets
    0 references
    combinatorial block designs
    0 references
    roots of polynomials over finite fields
    0 references
    0 references
    0 references