Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1017/S0963548320000292 | COMBINATORICS PROBABILITY & COMPUTING |
Field | DocType | Volume |
Matroid,Discrete mathematics,Combinatorics,Natural class,Mathematics | Journal | 30 |
Issue | ISSN | Citations |
1 | 0963-5483 | 2 |
PageRank | References | Authors |
0.40 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heng Guo | 1 | 85 | 12.02 |
| mark jerrum | 2 | 2755 | 564.62 |