The Tractability of SHAP-scores over Deterministic and Decomposable Boolean Circuits.
Marcelo ArenasPablo BarcelóLeopoldo E. BertossiMikaël MonetPublished in: CoRR (2020)
Keyphrases
- np complete
- real valued
- boolean functions
- high speed
- analog vlsi
- constraint satisfaction
- logic synthesis
- delay insensitive
- markov networks
- computational complexity
- high level synthesis
- score distributions
- randomized algorithms
- black box
- real time
- boolean queries
- boolean formula
- asynchronous circuits
- digital circuits
- logic circuits
- circuit design
- linear functions
- relaxation algorithm
- ranked list
- infrared
- vlsi circuits
- tractable cases
- substantially higher