arXiv (All)
open access
Infinite Communication Complexity and KW Games
We characterize the Borel sets with an infinite version of Karchmer and Wigderson's game linking finite circuit complexity to communication complexity. To this end, we formulate an infinite version of communication complexity and prove that a given subset of the Cantor space is Borel if and only if
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A thickness boundary and modular obstructions for two-set radial projections#926324
- Kuhn's Theorem for Games of the Extensive Form with Unawareness#147064
- Sure-wins under coherence: a geometrical perspective#702325
- Fair infinite lotteries#776799
- Universal Nonuniform Sampling of Positive Operator Orbits via Complete Stein--Pick Criteria and Density#974094
Record · ID 820057
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive