scientific article; zbMATH DE number 3777739

zbMATH Open0494.20020MaRDI QIDQ3957134FDOQ3957134

Authors: Jürgen Avenhaus, Klaus Madlener 

Publication date: 1981

Full work available at URL: https://eudml.org/doc/92148

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexityrecursively presented groupsword problemHNN extensionfinitely presented groupGrzegorczyk hierarchy

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Theory of numerations, effectively presented structures (03D45) Finite nilpotent groups, (p)-groups (20D15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Title not available (Why is that?)
• Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität
• Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität
• The word problem and power problem in 1-relator groups are primitive recursive
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Model-theoretic and algorithmic questions in group theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3957134)