1 citations · 2 across the 7 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2023
Inapproximability of sufficient reasons for decision trees
Alexander Kozachinskiy
In this note, we establish the hardness of approximation of the problem of computing the minimal size of a -sufficient reason for decision trees.
cs.CC2015
Some Bounds on Communication Complexity of Gap Hamming Distance
Alexander Kozachinskiy
In this paper we obtain some bounds on communication complexity of Gap Hamming Distance problem (): Alice and Bob are given binary string of length and t…