arXiv (All)open access
Exponential Sampling Lower Bounds for Polynomial Sources
computational complexity, combinatorics
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 973952
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.