The complexity of checking the polynomial completeness of finite quasigroups (Q783116): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/dma-2020-0016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3034323708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially complete quasigroups of prime order / 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: Q4977453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5412425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3955414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2995566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Algebras on Finite Sets / rank
 
Normal rank

Latest revision as of 05:10, 23 July 2024

scientific article
Language Label Description Also known as
English
The complexity of checking the polynomial completeness of finite quasigroups
scientific article

    Statements

    The complexity of checking the polynomial completeness of finite quasigroups (English)
    0 references
    0 references
    0 references
    30 July 2020
    0 references
    quasigroup
    0 references
    Latin square
    0 references
    polynomial completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references