The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (Q2311889): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy in Baumslag's group, generic case complexity, and division in power circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authentication from Matrix Conjugation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform constant-depth threshold circuits for division and iterated multiplication. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5662582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of circuits over nilpotent and polycyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing \(\text{TC}^{0}\) in terms of infinite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of small majority-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conjugacy Problem in Wreath Products and Free Metabelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Group-Theoretic Decision Problems and Their Classification. (AM-68) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word and geodesic problems in free solvable 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: TC^0 circuits for algorithmic problems in nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of a Magnus embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial group theory and public key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time conjugacy in wreath products and free solvable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups / rank
 
Normal rank

Latest revision as of 19:51, 19 July 2024

scientific article
Language Label Description Also known as
English
The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)
scientific article

    Statements

    The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    wreath products
    0 references
    conjugacy problem
    0 references
    word problem
    0 references
    \(\mathsf{TC}^0\)
    0 references
    free solvable group
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references