arXiv (All)open access
A Simple Construction of Locally Checkable Problems Filling the LOCAL Complexity Gaps in Graphs with Arbitrary Large Degrees
distributed, parallel, and cluster computing
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 971857
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.