ConceptioArchivearXiv (All)
arXiv (All)open access

Marton's conjecture in polynomial time

Arunachalam, Srinivasan et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
combinatoricscomputational-complexityquantum-physics
computational complexity, combinatorics, quantum physics
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗

Related documents

Record · ID 1034565
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.