A note on the query complexity of the Condorcet winner problem
暂无分享,去创建一个
[1] Michael E. Saks,et al. A topological approach to evasiveness , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[2] Vincent Conitzer,et al. Communication complexity of common voting rules , 2005, EC '05.
[3] Valerie King. Lower bounds on the complexity of graph properties , 1988, STOC '88.
[4] Arnold L. Rosenberg. On the time required to recognize properties of graphs: a problem , 1973, SIGA.
[5] Joseph Naor,et al. Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments , 1990, SIAM J. Discret. Math..
[6] Ronald L. Rivest,et al. On Recognizing Graph Properties from Adjacency Matrices , 1976, Theor. Comput. Sci..
[7] J. Moon. Topics on tournaments , 1968 .
[8] David C. Mcgarvey. A THEOREMI ON THE CONSTRUCTION OF VOTING PARADOXES , 1953 .