Approximately counting bases of bicircular matroids
Not on the map. Why?
Abstract (arXiv)
We give a fully polynomial-time randomised approximation scheme (FPRAS) for the number of bases in a bicircular matroids. This is a natural class of matroids for which counting bases exactly is #P-hard and yet approximate counting can be done efficiently.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 28 Aug 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.