Logspace and compressed-word computations in nilpotent groups (Q5100019): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1090/tran/8623 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2211936080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic theory of polycyclic-by-finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy in Nilpotent Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full residual finiteness growths of nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time complexity of the conjugacy problem in relatively hyperbolic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logspace Computations in Graph Groups and Coxeter Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On groups that have normal forms computable in logspace. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate separability in polycyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups of polynomial growth and expanding maps. Appendix by Jacques Tits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some general algorithms. II: Nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLVING THE WORD PROBLEM IN REAL TIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Matrix Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Collection using Deep Thought / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems Solvable in Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation in Groups Via Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-natural algorithms for the word problem for finitely presented monoids and groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homomorphisms onto finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational algorithms for deciding some problems for nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Post correspondence problem in groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-commutative lattice problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix representations for torsion-free nilpotent groups by Deep Thought. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time word problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time conjugacy in wreath products and free solvable groups / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1090/TRAN/8623 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:55, 30 December 2024

scientific article; zbMATH DE number 7576868
Language Label Description Also known as
English
Logspace and compressed-word computations in nilpotent groups
scientific article; zbMATH DE number 7576868

    Statements

    Logspace and compressed-word computations in nilpotent groups (English)
    0 references
    29 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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