On Sat, Aug 2, 2008 at 1:14 AM, Kristofer Munsterhjelm
[EMAIL PROTECTED] wrote:
Kathy Dopp wrote:
given:
R = the number of possible rankings or IRV rounds
N = the number of candidates in each election contest
the total number of permutations and the number of vote counts which
must be
Kathy Dopp wrote:
Well, any election method can be parallelized (in quote marks) with a
superpolynomial amount of information when there are as many choices as
candidates.
I am not certain what you mean. Precisely, any Ranked Choice ballot
has a number of possible permutations of all the
