Academic Journal
Parallel algorithms for power circuits and the word problem of the Baumslag group.
| Title: | Parallel algorithms for power circuits and the word problem of the Baumslag group. |
|---|---|
| Authors: | Mattes, Caroline, Weiß, Armin |
| Source: | Computational Complexity; Dec2023, Vol. 32 Issue 2, p1-76, 76p |
| Abstract: | Power circuits have been introduced in 2012 by Myasnikov, Ushakov and Won as a data structure for non-elementarily compressed integers supporting the arithmetic operations addition and (x , y) ↦ x · 2 y . The same authors applied power circuits to give a polynomial time solution to the word problem of the Baumslag group, which has a non-elementary Dehn function. In this work, we examine power circuits and the word problem of the Baumslag group under parallel complexity aspects. In particular, we establish that the word problem of the Baumslag group can be solved in NC — even though one of the essential steps is to compare two integers given by power circuits and this, in general, is shown to be P-complete. The key observation is that the depth of the occurring power circuits is logarithmic and such power circuits can be compared in NC. [ABSTRACT FROM AUTHOR] |
| Copyright of Computational Complexity is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| ISSN: | 10163328 |
| DOI: | 10.1007/s00037-023-00244-x |
| Database: | Complementary Index |