No. Title Author Year
1 Satisfiability Problems for Finite Groups Idziak, Paweł M. et al. 2022
2 The Isomorphism Problem for Plain Groups Is in Σ₃^{?} Dietrich, Heiko et al. 2022
3 Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group Mattes, Caroline et al. 2021
4 An Automaton Group with PSPACE-Complete Word Problem Wächter, Jan Philipp et al. 2020
5 Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems Bartholdi, Laurent et al. 2020
6 Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis Weiß, Armin 2020
7 The Power Word Problem Lohrey, Markus et al. 2019
8 The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE Sénizergues, Géraud et al. 2018
9 TC^0 Circuits for Algorithmic Problems in Nilpotent Groups Myasnikov, Alexei et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI