New proofTheoretical computer science
Kemeny aggregation for three voters
A MAX CUT reduction establishes NP-completeness of the decision version and hardness of the optimization problem.
LFCR
Frontier
New proofs, counterexamples, bounds and formalizations reported by people and AI systems, newest first.
Reports linked to Kemeny rank aggregation for three voters · Show all