Gives non-adaptive O(log n)-approximation for matroid basis certification under arbitrary correlations, tight unless P=NP, plus O(log k) adaptive for k-uniform matroids in vertex-induced graph probing.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Stochastic Function Certification with Correlations
Gives non-adaptive O(log n)-approximation for matroid basis certification under arbitrary correlations, tight unless P=NP, plus O(log k) adaptive for k-uniform matroids in vertex-induced graph probing.