Low-complexity computations for nilpotent subgroup problems (Q4968234): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128508044, #quickstatements; #temporary_batch_1727994688163
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Alexei G. Myasnikov / rank
Normal rank
 
Property / author
 
Property / author: Alexei G. Myasnikov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposability of finitely generated torsion-free nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations in nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random nilpotent groups, polycyclic presentations, and Diophantine problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some general algorithms. II: Nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4650358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342725 / 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: Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics on SLP-compressed strings: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Compressed Word Problem for Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational subsets of unitriangular groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logspace and compressed-word computations in nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problem for nilpotent groups / 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: Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine questions in the class of finitely generated nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963957759 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128508044 / rank
 
Normal rank

Latest revision as of 23:59, 3 October 2024

scientific article; zbMATH DE number 7079848
Language Label Description Also known as
English
Low-complexity computations for nilpotent subgroup problems
scientific article; zbMATH DE number 7079848

    Statements

    Low-complexity computations for nilpotent subgroup problems (English)
    0 references
    0 references
    0 references
    0 references
    12 July 2019
    0 references
    nilpotent groups
    0 references
    threshold circuits
    0 references
    logspace
    0 references
    compressed words
    0 references
    simultaneous conjugacy
    0 references
    subgroup intersection
    0 references

    Identifiers

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