Average-case lower bounds for the plurality problem
From MaRDI portal
Publication:4962730
DOI10.1145/1367064.1367067zbMath1445.68367OpenAlexW2000986517MaRDI QIDQ4962730
Laurent Alonso, Edward M. Reingold
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1367064.1367067
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Average-case lower bounds for the plurality problem