10 citations · 19 across the 11 of their papers we have counts for
Showing 2021 · cs.CCShow all
2 papers · 2 filters
cs.CC2021
Several Separations Based on a Partial Boolean Function
Kaspars Balodis
We show a partial Boolean function together with an input such that both and are at leas…
cs.CC2021
Unambiguous DNFs and Alon-Saks-Seymour
Kaspars Balodis, Shalev Ben-David, Mika Göös +2
We exhibit an unambiguous k-DNF formula that requires CNF width , which is optimal up to logarithmic factors. As a consequence, we get a near-optimal solution to the…