Year: 1993
Title: Seperating the Intrinsic Complexity and the Derivational Complexity of the Word Problem for Finitely Presented Groups
Journal: Mathematical Logic Quarterly, 39, 143-157
Comments: Shows that arithmetic hierarchy complexity of an algorithmn that gives the derivation of a word w from 1 is arbitrarily more complicated than just solving the word problem. Complexity defined as the level in the arithmetic hierarchy
Keywords: MATHS, ARITHMETIC, COMPLEXITY,
| Top | Authors | Journals | Years | Keywords | Search | New | Comments |