Generic complexity of finitely presented monoids and semigroups
type: Item
instance of: scholarly article
title: Generic complexity of finitely presented monoids and semigroups
zbMATH Open document ID: 1252.68153
author: Mark Kambites
published in: Computational Complexity
publication date: 2012-09-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 6085138
zbMATH Keywords: generic-case complexity
zbMATH Keywords: monoids
zbMATH Keywords: semigroups
zbMATH Keywords: finite presentations
MaRDI profile type: Publication
full work available at URL: s00037-011-0005-5
OpenAlex ID: W1999298839
cites work: Word hyperbolic semigroups
cites work: Q3772406
cites work: Q4036598
cites work: Q4003180
cites work: Small overlap monoids. I: The word problem.
cites work: Small overlap monoids. II: Automatic structures and normal forms.
cites work: Generic-case complexity, decision problems in group theory, and random walks.
cites work: Q4145882
cites work: Q5783653
cites work: ALMOST EVERY GROUP IS HYPERBOLIC
cites work: Recursive Unsolvability of a problem of Thue
cites work: On the geometry of semigroup presentations
cites work: Length-based cryptanalysis: the case of Thompson's group
cites work: Easy multiplications. I: The realm of Kleene's theorem
cites work: Thompson’s Group and Public Key Cryptography
cites work: Combinatorial group theory and public key cryptography
DOI: 10.1007/S00037-011-0005-5
description: scientific article; zbMATH DE number 6085138