The plurality problem with three colors and more.
type: Item
instance of: scholarly article
title: The plurality problem with three colors and more.
zbMATH Open document ID: 1107.90025
author: Martin Aigner
author: Gianluca De Marco
author: Manuela Montangero
published in: Theoretical Computer Science
publication date: 2005-06-30T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 91B24
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 2184059
zbMATH Keywords: Combinatorial search
zbMATH Keywords: Algorithm analysis
zbMATH Keywords: Majority problem
zbMATH Keywords: Game
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.12.035
OpenAlex ID: W1972715414
cites work: Q3994535
cites work: Variants of the majority problem.
cites work: STACS 2004
cites work: The worst-case chip problem
cites work: Determining the majority
cites work: The Average-Case Complexity of Determining the Majority
cites work: Mathematical Foundations of Computer Science 2003
cites work: Optimization of Reduced Dependencies for Synchronous Sequential Machines
cites work: On computing majority by comparisons
cites work: Search for a majority element
DOI: 10.1016/J.TCS.2004.12.035
Recommended article: STACS 2004
Recommended article: A plurality problem with three colors and query size three
Recommended article: A note on the three color problem
Recommended article: Q3139765
Recommended article: Q4501634
Recommended article: Q3514492
description: scientific article; zbMATH DE number 2184059