A note on the query complexity of the Condorcet winner problem
type: Item
instance of: scholarly article
title: A note on the query complexity of the Condorcet winner problem
zbMATH Open document ID: 1191.68899
author: Ariel D. Procaccia
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5719220
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: theory of computation
zbMATH Keywords: concrete complexity
zbMATH Keywords: social choice
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.07.012
OpenAlex ID: W2019927599
cites work: Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
cites work: A topological approach to evasiveness
cites work: Q5585195
cites work: On recognizing graph properties from adjacency matrices
DOI: 10.1016/J.IPL.2008.07.012
description: scientific article; zbMATH DE number 5719220