Communication between any two parties in a
group scales is an O(n^2) issue, but that is
just for starters. This is because everyone in
the company can talk with anyone else. If we
have groups of three people, we can have n(n-
1)(n-2)=n!/(n-3!) combinations, for each
combination, we have 3 potential speakers and 3
groups of listeners. By induction, you can see
that we have n^a groups (where a is the group
size.) Within each group, there are a! pairs
of communicators.
I believe that this moves us to an exponential,
as in exp(n), time dependence. Not the
marketing-speak 'exponential' meaning "rapidly
growing in some way we don't understand". This
is no longer a problem solvable in 'polynomial
time'.
Discussion on:
Message 2 of 1
The best of ZDNet, delivered
ZDNet Newsletters
Get the best of ZDNet delivered straight to your inbox
