Auditing disclosure-robust formal explanations yields a four-cell complexity landscape (P, coNP-complete, NP-complete, Σ₂^p-complete), with the first known Σ₂^p-complete audit query in this setting.
The Computational Complexity of Understanding Binary Classifier Decisions , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Complexity of Auditing Disclosure-Robust Defeasible Explanations
Auditing disclosure-robust formal explanations yields a four-cell complexity landscape (P, coNP-complete, NP-complete, Σ₂^p-complete), with the first known Σ₂^p-complete audit query in this setting.