2000 character limit reached
Approximately counting bases of bicircular matroids
Published 28 Aug 2018 in cs.DS and math.CO | (1808.09548v4)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.