Generic complexity of finitely presented monoids and semigroups (Q451108): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20M05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6085138 / rank
 
Normal rank
Property / zbMATH Keywords
 
generic-case complexity
Property / zbMATH Keywords: generic-case complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
monoids
Property / zbMATH Keywords: monoids / rank
 
Normal rank
Property / zbMATH Keywords
 
semigroups
Property / zbMATH Keywords: semigroups / rank
 
Normal rank
Property / zbMATH Keywords
 
finite presentations
Property / zbMATH Keywords: finite presentations / rank
 
Normal rank
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.1007/s00037-011-0005-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999298839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word hyperbolic semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small overlap monoids. I: The word problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small overlap monoids. II: Automatic structures and normal forms. / 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: Q4145882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5783653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALMOST EVERY GROUP IS HYPERBOLIC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Unsolvability of a problem of Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of semigroup presentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-based cryptanalysis: the case of Thompson's group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy multiplications. I: The realm of Kleene's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thompson’s Group and Public Key Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial group theory and public key cryptography / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:47, 5 July 2024

scientific article
Language Label Description Also known as
English
Generic complexity of finitely presented monoids and semigroups
scientific article

    Statements

    Identifiers