output
20142024
most citedModel Interpretability through the Lens of Computational Complexity

38 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2014 · cs.FLShow all

1 paper · 2 filters

cs.FL2014

The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard

P. -C Héam, V. Hugot, O. Kouchnarenko

The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequa…