Colorless tasks are solvable against a compact adversary iff there exists a spectral map from the projective limit of protocol states to the output space compatible with the task specification.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Stone Duality Proofs for Colorless Distributed Computability Theorems
Colorless tasks are solvable against a compact adversary iff there exists a spectral map from the projective limit of protocol states to the output space compatible with the task specification.