The Nielsen reduction and P-complete problems in free groups
Open Access
- 1 January 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 32 (1-2) , 61-76
- https://doi.org/10.1016/0304-3975(84)90024-0
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Algorithmische Probleme bei Einrelatorgruppen und ihre KomplexitätArchive for Mathematical Logic, 1978
- Subrekursive Komplexität bei GruppenActa Informatica, 1978
- Word Problems Solvable in LogspaceJournal of the ACM, 1977
- Subrekursive Komplexität bei GruppenActa Informatica, 1977
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976