1 citations · 1 across the 5 of their papers we have counts for
6 papers
Finding the diameter of a tree with distance queries
Dániel Gerbner, András Imolay, Kartal Nagy +2
We study the number of distance queries needed to identify certain properties of a hidden tree on vertices. A distance query consists of two vertices , and the answer…
A new intersection condition in extremal set theory
Kartal Nagy
We call a family -intersecting if for all , , . We try to look for the maximum size…
Identification of a monotone Boolean function with "reasons" as a combinatorial search problem
Dániel Gerbner, András Imolay, Gyula O. H. Katona +5
We study the number of queries needed to identify a monotone Boolean function . A query consists of a 0-1-sequence, and the answer is the value of…
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…
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…
Chain-dependent Conditions in Extremal Set Theory
Dániel T. Nagy, Kartal Nagy
In extremal set theory our usual goal is to find the maximal size of a family of subsets of an -element set satisfying a condition. A condition is called chain-dependent, if it…