scientific article

From MaRDI portal

Revision as of 20:29, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3902990

Jump to:navigation, search

zbMath0455.03014MaRDI QIDQ3902990

Friedrich Otto

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmic problems countably generated groups

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Applications of computability and recursion theory (03D80)

Related Items (2)

Complexity results on the conjugacy problem for monoids ⋮ Pseudo-natural algorithms for the word problem for finitely presented monoids and groups

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3902990&oldid=17556913"