Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems

Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems We give lower bounds on the complexity of the word problem for a large class of non-solvable infinite groups that we call strongly efficiently non-solvable groups. This class includes free groups, Grigorchuk’s group, and Thompson’s groups. We prove that these groups have an NC1-hard word problem and that for some of them (including Grigorchuk’s group and Thompson’s groups) the compressed word problem (which is equivalent to the circuit evaluation problem) is PSPACE-complete. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computation Theory (TOCT) Association for Computing Machinery

Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems

Loading next page...
 
/lp/association-for-computing-machinery/groups-with-alogtime-hard-word-problems-and-pspace-complete-compressed-00935mV8nr

References (103)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2022 Copyright held by the owner/author(s). Publication rights licensed to ACM.
ISSN
1942-3454
eISSN
1942-3462
DOI
10.1145/3569708
Publisher site
See Article on Publisher Site

Abstract

We give lower bounds on the complexity of the word problem for a large class of non-solvable infinite groups that we call strongly efficiently non-solvable groups. This class includes free groups, Grigorchuk’s group, and Thompson’s groups. We prove that these groups have an NC1-hard word problem and that for some of them (including Grigorchuk’s group and Thompson’s groups) the compressed word problem (which is equivalent to the circuit evaluation problem) is PSPACE-complete.

Journal

ACM Transactions on Computation Theory (TOCT)Association for Computing Machinery

Published: Feb 1, 2023

Keywords: NC1-hardness

There are no references for this article.