Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

65

Voted

IPL
2008

favoriteEmaildiscussreport

67views more IPL 2008»

A note on the query complexity of the Condorcet winner problem

15 years 22 days ago

A note on the query complexity of the Condorcet winner problem

Download people.seas.harvard.edu

Ariel D. Procaccia

Real-time Traffic

IPL 2008 |

claim paper

Related Content

» Parameterized computational complexity of Dodgson and Young elections

» DynFO A Parallel Dynamic Complexity Class

» A nearly optimal oracle for avoiding failed vertices and edges

» Dynamic indexability and lower bounds for dynamic onedimensional range query indexes

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Ariel D. Procaccia

Comments (0)