1 problem

0 votes0 replies1 view
Gerbner–Keszegh–Pálvölgyi–Patkós–Vizer–Wiener conjecture on odd-size majority queries
Gerbner–Keszegh–Pálvölgyi–Patkós–Vizer–Wiener conjecture. For every positive integer $k$ , one has
Conjectureopencombinatorial-search graph-algorithms majority-queriesarXiv posted 3 days ago

Gerbner–Keszegh–Pálvölgyi–Patkós–Vizer–Wiener conjecture on odd-size majority queries