Taming the hydra: The word problem and extreme integer compression (Q4554889): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A non-cyclic one-relator group all of whose finite quotients are cyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5825667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5829816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3228627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of the word problem for finitely generated groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2899316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hydra groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed word problems in HNN-extensions and amalgamated products / 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: A Finitely Generated Infinite Simple Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmically complex residually finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems and Membership Problems on Compressed Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Word Problems for Inverse Monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Compressed Word Problem for Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation in Groups Via Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145882 / 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: POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3368911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic invariants, complexity of groups and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time word problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135833 / rank
 
Normal rank

Revision as of 07:32, 17 July 2024

scientific article; zbMATH DE number 6976263
Language Label Description Also known as
English
Taming the hydra: The word problem and extreme integer compression
scientific article; zbMATH DE number 6976263

    Statements

    Taming the hydra: The word problem and extreme integer compression (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2018
    0 references
    Ackermann functions
    0 references
    subgroup distortion
    0 references
    Dehn function
    0 references
    hydra
    0 references
    word problem
    0 references
    membership problem
    0 references
    polynomial time
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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