5 citations · 17 across the 9 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
Submodular Goal Value of Boolean Functions
Eric Bach, Jeremie Dusart, Lisa Hellerstein +1
Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the "goal value" of the function. The goal value of is defined…
cs.DM2011
On the gap between ess(f) and cnf_size(f)
Lisa Hellerstein, Devorah Kletenik
Given a Boolean function f, the quantity ess(f) denotes the largest set of assignments that falsify f, no two of which falsify a common implicate of f. Although ess(f)$ is clearly…