搜索结果: 1-1 共查到“数学 the voting problem”相关记录1条 . 查询时间(0.093 秒)
Let $v(n)$ be the minimum number of voters with transitive preferences which are needed to generate any strong preference pattern (ties not allowed) on $n$ candidates. Let $k=\lfloor \log_2 n\rfloor$....