4 citations · 11 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019★ 4 cited
A tighter bound on the number of relevant variables in a bounded degree Boolean function
Jake Wellens
A classical theorem of Nisan and Szegedy says that a boolean function with degree as a real polynomial depends on at most of its variables. In recent work by Chiarel…
cs.DM2017★ 2 cited
On Graphs and the Gotsman-Linial Conjecture for d = 2
Hyo Won Kim, Chris Maldonado, Jake Wellens
We give an infinite class of counterexamples to the Gotsman-Linial conjecture when d = 2. On the other hand, we establish an asymptotic form of the conjecture for quadratic thresho…