ConceptioArchivearXiv (All)
arXiv (All)open access

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

Lingas, Andrzej
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
and-cluster-computingcomputational-complexitydata-structures-and-algorithmsdistributedparallel
distributed, parallel, and cluster computing, computational complexity, data structures and algorithms, f.2.2, f.2.2
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 986246
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.