On the problem of approximating the number of bases of a matriod
- 1 April 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 50 (1) , 9-11
- https://doi.org/10.1016/0020-0190(94)90037-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Random walks in a convex body and an improved volume algorithmRandom Structures & Algorithms, 1993
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- A geometric inequality and the complexity of computing volumeDiscrete & Computational Geometry, 1986
- The computational complexity of matroid propertiesMathematical Proceedings of the Cambridge Philosophical Society, 1980
- The asymptotic number of geometriesJournal of Combinatorial Theory, Series A, 1974
- On the Number of Combinatorial GeometriesBulletin of the London Mathematical Society, 1971