Computing normalisers of intransitive groups (Q2142483): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3216713423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint direct product decompositions of permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive normalisers in quasipolynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of normalizers in permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4650358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing transitive permutation groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3545337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of GAP normalizer function for permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is code equivalence easy to decide? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalisers of primitive permutation groups in quasipolynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalizes and permutational isomorphisms in simply-exponential time / rank
 
Normal rank

Latest revision as of 03:34, 29 July 2024

scientific article
Language Label Description Also known as
English
Computing normalisers of intransitive groups
scientific article

    Statements

    Computing normalisers of intransitive groups (English)
    0 references
    0 references
    0 references
    0 references
    27 May 2022
    0 references
    0 references
    computational group theory
    0 references
    permutation groups
    0 references
    backtrack search
    0 references
    0 references