On the subgroup distance problem. (Q1011736): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear optimization over permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the Weight Problem for permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-Complete Problems Similar to Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895641 / rank
 
Normal rank

Latest revision as of 12:00, 1 July 2024

scientific article
Language Label Description Also known as
English
On the subgroup distance problem.
scientific article

    Statements

    On the subgroup distance problem. (English)
    0 references
    0 references
    0 references
    0 references
    9 April 2009
    0 references
    permutation groups
    0 references
    subgroup distances
    0 references
    metrics
    0 references
    NP-complete problems
    0 references
    computational complexity
    0 references

    Identifiers

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