✦ LIBER ✦

The Unsolvability of the Problem of the Equivalence of Words in a Group and Several Other Problems in Algebraby P. S. Novikov

✍ Scribed by Review by: A. Włodzimierz Mostowski

Book ID: 124963165
Publisher: Association for Symbolic Logic
Year: 1964
Tongue: English
Weight: 340 KB
Volume: 29
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2269790

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithmic Unsolvability of the Word Pr

Algorithmic Unsolvability of the Word Problem in Group Theoryby P. S. Novikov

✍ Review by: J. L. Britton 📂 Article 📅 1958 🏛 Association for Symbolic Logic 🌐 English ⚖ 461 KB

Unsolvability of the Conjugacy Problem i

Unsolvability of the Conjugacy Problem in Group Theoryby P. S. Novikov

✍ Review by: J. L. Britton 📂 Article 📅 1958 🏛 Association for Symbolic Logic 🌐 English ⚖ 451 KB

Example of a finitely presented group in

Example of a finitely presented group in the variety α5with the unsolvable word problem

✍ V. N. Remeslennikov 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 1012 KB

The complexity of Dehn's algorithm for w

The complexity of Dehn's algorithm for word problems in groups

✍ B Domanski; M Anshel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Unsolvability of the endomorphic reducib

Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings

✍ V. A. Roman'kov 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 552 KB

On complexity of the word problem in bra

On complexity of the word problem in braid groups and mapping class groups

✍ Hessam Hamidi-Tehrani 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 350 KB

We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w| 2 g) for |w| log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w| 2 g 2 ). We also carry