Knapsack Problems for Wreath Products (Q3304131): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q122781748, #quickstatements; #temporary_batch_1714685954669
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Subgroup distortion in wreath products of cyclic groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems in products of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The co-word problem for the Higman-Thompson group is context-free / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational subsets and submonoids of wreath products. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack in graph groups, HNN-extensions and amalgamated products / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Knapsack in Graph Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problem for nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems in groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset sum problem in polycyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Marshall Hall / rank
 
Normal rank

Latest revision as of 05:24, 23 July 2024

scientific article
Language Label Description Also known as
English
Knapsack Problems for Wreath Products
scientific article

    Statements

    Identifiers

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