An O(n^{3/2})-size subgraph preserves 2-approximate min-cost arborescences under single edge faults with fast updates, plus a tight k times rank bound for k-fault-tolerant matroid preservers.
Testing juntas nearly optimally
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
k-juntas, low-degree Fourier functions, and sparse polynomials are testable with O(1/ε) queries independent of n for small ε.
citing papers explorer
-
Low-Cost Arborescence Under Edge Faults
An O(n^{3/2})-size subgraph preserves 2-approximate min-cost arborescences under single edge faults with fast updates, plus a tight k times rank bound for k-fault-tolerant matroid preservers.
-
Classes Testable with $O(1/\epsilon)$ Queries for Small $\epsilon$ Independent of the Number of Variables
k-juntas, low-degree Fourier functions, and sparse polynomials are testable with O(1/ε) queries independent of n for small ε.