It is proved that, for a prime number pp, showing that an nn-element matroid is not representable over GF(p)GF(p) requires only O(n2)O(n2) rank evaluations.
生成讲解博客的中文版本
生成AI智能校验的中文版本