Conceptio › Archive › arXiv (All)
arXiv (All)open access

Improved lower bounds for decomposable randomized encoding

Holmgren, Justin et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
computational-complexitycryptography-and-securitydiscrete-mathematics
computational complexity, cryptography and security, discrete mathematics
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 1011729
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.