Computing Majority with Triple Queries

DOI10.1007/978-3-642-22685-4_52zbMath1353.68292arXiv1105.1622OpenAlexW1515035281MaRDI QIDQ3087986

Gábor Wiener, Evangelos Kranakis, Gianluca De Marco

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

searchballscolorspairing modelqueriescomputation modelsY/N model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items

On non-adaptive majority problems of large query size