Dehn's Algorithm and the Complexity of Word Problems

From MaRDI portal

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

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

Publication:3826535

Jump to:navigation, search

DOI10.2307/2322385zbMath0673.03028OpenAlexW2094015074MaRDI QIDQ3826535

Ronald V. Book

Publication date: 1988

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2322385

zbMATH Keywords

rewriting system linear-time algorithm finite Thue system

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) 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) Thue and Post systems, etc. (03D03)

Related Items (2)

Complexity, combinatorial group theory and the language of palutators ⋮ Reductions and functors from problems to word problems

This page was built for publication: Dehn's Algorithm and the Complexity of Word Problems

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