scientific article; zbMATH DE number 3777739

MaRDI QIDQ3957134zbMATH OpenFDO

Authors Jürgen Avenhaus, Klaus Madlener

Publication date 1981

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

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

• scientific article; zbMATH DE number 3467389 (Why is no real title available?)
• scientific article; zbMATH DE number 3468805 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 3430637 (Why is no real title available?)
• Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität
• Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität
• The word problem and power problem in 1-relator groups are primitive recursive

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)