Approximately counting bases of bicircular matroids

08/28/2018
by   Heng Guo, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset