| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656752 | Journal of Combinatorial Theory, Series B | 2016 | 12 Pages |
Abstract
It is proved that, for a prime number p, showing that an n -element matroid is not representable over GF(p)GF(p) requires only O(n2)O(n2) rank evaluations.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jim Geelen, Geoff Whittle,