arXiv (All)
open access
An FPRAS for Counting Common Bases of Two Matroids
We design the first polynomial-time algorithms for approximately counting and almost uniformly sampling common bases of two matroids given by their independence oracles. Moreover, our algorithms generalize far beyond this to Hadamard products of two probability measures on the Boolean cube satisfyin
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
- On the Number of Distinct Topological Bases of a Finite Set of Size $N$#1083574
- Represented Tensor Products of Binary Matroids#1077156
- Mutually unbiased bases as extremal probes of isotropic random Hamiltonians#793675
- Mutually unbiased bases as extremal probes of isotropic random Hamiltonians#789671
- More mutually unbiased bases#1154571
Record · ID 1215811
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