Random van Kampen diagrams and algorithmic problems in groups (Q2882828): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/gcc.2011.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000976823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MULTIPLICATIVE MEASURES ON FREE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stallings foldings and subgroups of free groups / 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: Average-case complexity and decision problems in group theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS / rank
 
Normal rank

Latest revision as of 04:32, 5 July 2024

scientific article
Language Label Description Also known as
English
Random van Kampen diagrams and algorithmic problems in groups
scientific article

    Statements

    Random van Kampen diagrams and algorithmic problems in groups (English)
    0 references
    0 references
    0 references
    0 references
    7 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    word problem
    0 references
    finitely presented groups
    0 references
    search algorithms
    0 references
    random van Kampen diagrams
    0 references
    hyperbolic diagrams
    0 references
    Todd-Coxeter algorithm
    0 references
    fast algorithms
    0 references
    filling functions
    0 references
    0 references