Hello Vaughan,

it was not criticism, but a simple spontaneous uttering of opinion. I
wonder how it should work to downsize algorithms, which are known to have
exponential complexity, to polynomial complexity - regardless of the
magnitude of the degree (here called #P). So, why should that work for
algorithms, which are based on powersets, ie. nondeterministic ones?

Jens