Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Jean-Camille Birget / rank
Normal rank
 
Property / author
 
Property / author: Jean-Camille Birget / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data management support for database management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time- and tape-bounded Turing acceptors and AFLs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Computable groups and the word problem / 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: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-Limited Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Theorems with Amalgamation for Semigroups<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Bennett’s Time-Space Tradeoff for Reversible Computation / 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: HYPERBOLICITY OF GROUPS WITH SUBQUADRATIC ISOPERIMETRIC INEQUALITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of semigroup presentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gruppen mit vorgeschriebenem Wortproblem / rank
 
Normal rank

Revision as of 18:48, 27 May 2024

scientific article; zbMATH DE number 1060737
Language Label Description Also known as
English
Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
scientific article; zbMATH DE number 1060737

    Statements

    Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (English)
    0 references
    15 September 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    finitely generated semigroups
    0 references
    word problem
    0 references
    time complexity
    0 references
    isoperimetric functions
    0 references
    finitely presented semigroups
    0 references