Ask a Question

Prefer a chat interface with context about you and your work?

Approximately counting bases of bicircular matroids

Approximately counting bases of bicircular matroids

Abstract We give a fully polynomial-time randomized approximation scheme (FPRAS) for the number of bases in 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.