2026-07-21T19:38:41Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14514 2024-03-12T12:00:08Z ddc:004 open_access

Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group Mattes, Caroline Weiß, Armin Word problem Baumslag group power circuit parallel complexity 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 𝖯-complete. The key observation is that the depth of the occurring power circuits is logarithmic and such power circuits can be compared in NC. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Caroline Mattes and Armin Weiß 2021 Is Part Of LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2021.74 urn:nbn:de:0030-drops-145148 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.74 eng https://creativecommons.org/licenses/by/4.0/legalcode