In MPC with ≤N machines and limited local memory, N^{o(1)}-round protocols for super-linear sequential problems require local computation time exponents strictly larger than the problem's sequential time exponent.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
In MPC with ≤N machines and limited local memory, N^{o(1)}-round protocols for super-linear sequential problems require local computation time exponents strictly larger than the problem's sequential time exponent.