
doi: 10.37236/2396
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.
matroid bases, Combinatorics in computer science, Combinatorial aspects of matroids and geometric lattices, complexity, \#P complete
matroid bases, Combinatorics in computer science, Combinatorial aspects of matroids and geometric lattices, complexity, \#P complete
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
