On non-adaptive majority problems of large query size

DOI10.46298/dmtcs.7084OpenAlexW3217056993MaRDI QIDQ5024678

Dániel Gerbner, Máté Vizer

Publication date: 27 January 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.12638

zbMATH Keywords

majoritycombinatorial searchnon-adaptive

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Finding a non-minority ball with majority answers
• Finding non-minority balls with majority and plurality queries
• The smallest n-uniform hypergraph with positive discrepancy
• On computing majority by comparisons
• Majority problems of large query size
• From discrepancy to majority
• Majority and plurality problems
• On small \(n\)-uniform hypergraphs with positive discrepancy
• Computing majority via multiple queries
• Computing Majority with Triple Queries
• Improved bounds and algorithms for hypergraph 2-coloring
• Searching for majority with k-tuple queries

This page was built for publication: On non-adaptive majority problems of large query size