AI Chat AI Image Generator AI Video Text to Speech

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

page 1

page 2

page 3

page 4

Related Research

research
∙ 07/02/2018

The Complexity of Approximately Counting Retractions

Let G be a graph that contains an induced subgraph H. A retraction from ...
0 Jacob Focke, et al. ∙
research
∙ 07/02/2018

Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids

We give a deterministic polynomial time 2^O(r)-approximation algorithm f...
0 Nima Anari, et al. ∙
research
∙ 05/05/2023

On Optimization and Counting of Non-Broken Bases of Matroids

Given a matroid M=(E, I), and a total ordering over the elements E, a br...
0 Dorna Abdolazimi, et al. ∙
research
∙ 01/04/2017

On the Usability of Probably Approximately Correct Implication Bases

We revisit the notion of probably approximately correct implication base...
0 Daniel Borchmann, et al. ∙
research
∙ 06/26/2019

Counting Roots of a Polynomial in a Convex Compact Region by Means of Winding Number Calculation via Sampling

In this paper, we propose a novel efficient algorithm for calculating wi...
0 Vitaly Zaderman, et al. ∙
research
∙ 07/18/2019

Approximate counting CSP seen from the other side

In this paper we study the complexity of counting Constraint Satisfactio...
0 Andrei A. Bulatov, et al. ∙
research
∙ 08/27/2019

Counting Candy Crush Configurations

A k-stable c-coloured Candy Crush grid is a weak proper c-colouring of a...
0 Adam Hamilton, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal