2025/07/18 by Gupta, Aanchal, Gyula O. H. Katona, Katona, Gyula O. H.
Computer Science · #Advanced Algebra and Logic #Rough Sets and Fuzzy Logic #Complexity and Algorithms in Graphs
paper · pdf · doi:10.48550/arxiv.2507.13948
An n-element set contains an unknown number of excellent elements, and our goal is to identify at least one of these elements. The members of a family of subsets can be asked if they contain at least one excellent element or not. At most one of the answers can be wrong. We find the smallest family that finds one excellent element or claims that there is none.