EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CRAG / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: The word problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Finitely Generated Infinite Simple Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic-case complexity, decision problems in group theory, and random walks. / 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: Pseudo-natural algorithms for finitely generated presentations of monoids and groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Das Identitätsproblem für Gruppen mit einer definierenden Relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALMOST EVERY GROUP IS HYPERBOLIC / 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: Isoperimetric and isodiametric functions of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time word problems. / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218196712400085 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115760473 / rank
 
Normal rank

Latest revision as of 08:51, 30 July 2024

scientific article; zbMATH DE number 6132712
Language Label Description Also known as
English
EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P
scientific article; zbMATH DE number 6132712

    Statements

    EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (English)
    0 references
    0 references
    0 references
    0 references
    30 January 2013
    0 references
    Baumslag group
    0 references
    Higman group
    0 references
    data structures
    0 references
    compression
    0 references
    algorithmic group theory
    0 references
    word problem
    0 references

    Identifiers

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