In the size-sensitive independence oracle model, fundamental matroid tasks require quadratic query cost in general but admit subquadratic algorithms when maximum circuit size is bounded by a constant.
Proceedings of the forty-fourth annual ACM symposium on Theory of computing , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Matroid Algorithms Under Size-Sensitive Independence Oracles
In the size-sensitive independence oracle model, fundamental matroid tasks require quadratic query cost in general but admit subquadratic algorithms when maximum circuit size is bounded by a constant.