Quantum algorithms achieve poly(k) query complexity for tolerant k-junta testing with ε1 = 1/2-1/k and ε2 = 1/2-1/(2k²), while classical algorithms require k^Ω(log k) queries.
Testing juntas nearly optimally
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 2polarities
background 2representative citing papers
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.
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 ε.