Assertion: matroid parity | /r/CapableOf | access matroid
Facets:
value: by independence tests
type: OTHER
Source sentences:
text: k {\displaystyle k} , one can show that any deterministic or randomized algorithm for matroid parity that accesses its matroid only by independence tests needs to make an exponential number of tests.