Tight bounds on plurality

DOI10.1016/j.ipl.2005.06.004zbMath1178.68702MaRDI QIDQ1044713

Nikhil Srivastava, Alan D. Taylor

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.06.004

zbMATH Keywords

computational complexity; analysis of algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)