arXiv (All)
open access
The Minimum Number of Samples in the Labeled Coupon Collector Problem
The Labeled Coupon Collector Problem (LCCP) is an extension of the classical Coupon Collector Problem (CCP) in which one must deduce an unknown mapping between coupons and labels by collecting unordered subsets of k coupons and their associated labels, where deduction relies on analyzing the interse
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
- Recursive moments of the aggregate discounted claims with Erlang inter-occurrence distribution and dependence introduced by a FGM Copula#956662
- The Price of Privacy For Approximating Max-CSP#1109784
- A proof of the strong Erdős--Frankl--Füredi cover-free conjecture#1389388
- Personalised versus Posted Pricing from Samples#1064725
- Elementos totalmente positivos via CVP e enumeração#453182
Record · ID 1447618
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