Complete problems for symmetric logspace involving free groups
- 13 December 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 40 (5), 263-267
- https://doi.org/10.1016/0020-0190(91)90121-w
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- The Nielsen reduction and P-complete problems in free groupsTheoretical Computer Science, 1984
- Symmetric ComplementationJournal of the ACM, 1984
- Symmetric space-bounded computationTheoretical Computer Science, 1982
- Word Problems Solvable in LogspaceJournal of the ACM, 1977