Efficient verification of polynomial completeness of quasigroups (Q2206949): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonassociative algebraic structures in cryptography and coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: An assertion concerning functionally complete algebras and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3955414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Algebras on Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221860 / rank
 
Normal rank

Latest revision as of 23:01, 23 July 2024

scientific article
Language Label Description Also known as
English
Efficient verification of polynomial completeness of quasigroups
scientific article

    Statements

    Efficient verification of polynomial completeness of quasigroups (English)
    0 references
    27 October 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    quasigroup
    0 references
    polynomial completeness
    0 references
    simplicity
    0 references
    affinity
    0 references
    parallel implementation
    0 references