Tight bounds on plurality
type: Item
instance of: scholarly article
title: Tight bounds on plurality
zbMATH Open document ID: 1178.68702
author: Nikhil Srivastava
author: Alan D. Taylor
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5650137
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.06.004
OpenAlex ID: W1966180611
cites work: Determining the majority
cites work: The Average-Case Complexity of Determining the Majority
cites work: On computing majority by comparisons
cites work: Search for a majority element
DOI: 10.1016/J.IPL.2005.06.004
description: scientific article; zbMATH DE number 5650137