Complexity Theory

The Computational Complexity of Understanding Binary Classifier Decisions

For a $d$-ary Boolean function $\Phi\colon\{0,1\}^d\to\{0,1\}$ and an assignment to its variables $\mathbf{x}=(x_1, x_2, \dots, x_d)$ …

Stephan Wäldchen, Jan Macdonald, Sascha Hauch, Gitta Kutyniok