eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-10-05
37:1
37:7
10.4230/LIPIcs.DISC.2023.37
article
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations
Chen, Michael
1
Pavan, A.
1
Vinodchandran, N. V.
2
Iowa State University, Ames, IA, USA
University of Nebraska–Lincoln, NE, USA
In this work, we study the class of problems solvable by (deterministic) Adaptive Massively Parallel Computations in constant rounds from a computational complexity theory perspective. A language L is in the class AMPC⁰ if, for every ε > 0, there is a deterministic AMPC algorithm running in constant rounds with a polynomial number of processors, where the local memory of each machine s = O(N^ε). We prove that the space-bounded complexity class ReachUL is a proper subclass of AMPC⁰. The complexity class ReachUL lies between the well-known space-bounded complexity classes Deterministic Logspace (DLOG) and Nondeterministic Logspace (NLOG). In contrast, we establish that it is unlikely that PSPACE admits AMPC algorithms, even with polynomially many rounds. We also establish that showing PSPACE is a subclass of nonuniform-AMPC with polynomially many rounds leads to a significant separation result in complexity theory, namely PSPACE is a proper subclass of EXP^{Σ₂^{𝖯}}.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol281-disc2023/LIPIcs.DISC.2023.37/LIPIcs.DISC.2023.37.pdf
Massively Parallel Computation
AMPC
Complexity Classes
LogSpace
NL
PSPACE