Counting Bases of Representable Matroids Michael Snook DOI: https://doi.org/10.37236/2396 Keywords: matroid bases, #P complete, complexity Abstract We show that it is #P-complete to count the number of bases of matroids representable over a fixed infinite field or fields of fixed characteristic. PDF Published 2012-12-13 Issue Volume 19, Issue 4 (2012) Article Number P41
