Geodesic
Counting bases of representable matroids
Michael Snook1
1School of Mathematics, Statistics and Operations Research, Victoria University of Wellington.
The electronic journal of combinatorics, Tome 19 (2012) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/2396
Classification : 05B35, 68R05
Mots-clés : matroid bases, \#P complete, complexity

Michael Snook  1

1 School of Mathematics, Statistics and Operations Research, Victoria University of Wellington. 
@article{10_37236_2396,
     author = {Michael Snook},
     title = {Counting bases of representable matroids},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {4},
     doi = {10.37236/2396},
     zbl = {1267.05058},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2396/}
}
TY  - JOUR
AU  - Michael Snook
TI  - Counting bases of representable matroids
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2396/
DO  - 10.37236/2396
ID  - 10_37236_2396
ER  - 
%0 Journal Article
%A Michael Snook
%T Counting bases of representable matroids
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/2396/
%R 10.37236/2396
%F 10_37236_2396
Michael Snook. Counting bases of representable matroids. The electronic journal of combinatorics, Tome 19 (2012) no. 4. doi: 10.37236/2396

Cité par Sources :