✦ LIBER ✦

Algorithmic problems for metabelian groups

✍ Scribed by E. I. Timoshenko

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some algorithmic problems for solvable g

✍ N. S. Romanovskii 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 438 KB

Conjugacy problem in Metabelian groups

✍ G. A. Noskov 📂 Article 📅 1982 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 558 KB

Algorithmic problems forO-power groups-p

✍ M. I. Kargapolov; V. N. Remeslennikov; N. S. Romanovskii; V. A. Roman'kov; V. A. 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 741 KB

The twisted conjugacy problem for endomo

✍ E. Ventura; V. A. Roman’kov 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 201 KB

Some algorithmic problems for groups and

✍ A. V. Anisimov 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 861 KB

Algorithmic solvability of the problem o

✍ E. I. Timoshenko 📂 Article 📅 1992 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 312 KB