On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Lingas, Andrzej
Format:	Preprint
Published:	2026
Subjects:	Distributed, Parallel, and Cluster Computing Computational Complexity Data Structures and Algorithms F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2605.03376