66 citations · 66 across the 6 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
Query complexity of Boolean functions on the middle slice of the cube
Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy +4
We study the query complexity on slices of Boolean functions. Among other results we show that there exists a Boolean function for which we need to query all but 7 input bits to co…
math.CO2023
Cooperation in Combinatorial Search
Dániel Gerbner, Balázs Keszegh, Kartal Nagy +2
In the game theoretical approach of the basic problem in Combinatorial Search an adversary thinks of a defective element of an -element pool , and the questioner needs to…