Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Approximating the Number of Bases for Almost All Matroids

Published

Author(s)

Brian D. Cloteaux

Abstract

We define a class of matroids A for which a fully polynomial randomized approximation scheme (fpras) exists for counting the number of bases of the matroids. We then show that as the number of elements in a matroid increases, the probability that a matroid belongs to A goes to 1. We thus provide a fpras for counting the number of bases that applies to almost all matroids.
Citation
Congressus Numerantium
Volume
202

Keywords

matroids, randomized algorithms

Citation

Cloteaux, B. (2011), Approximating the Number of Bases for Almost All Matroids, Congressus Numerantium, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=900881 (Accessed June 23, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created February 1, 2011, Updated February 19, 2017