Saibal Mitra:
I think that a polynomial time algorithm means that the algorithm's running
time is a polynomial in
Log(n)/Log(2), not n, because the size of the input matters, not the value
of the number.
That makes sense. You could have said polynomial in log(n) I suppose.
I guess it is in
Saibal Mitra:
I don't know what the relevance [of PRIMES in P] to quantum computing is.
Doug Donaghue:
Other than getting primality and factoring confused, I don't knnow either.
BM:
MEA CULPA! (my fault, my confusion)
And that's nothing compared to my mixing of the bowsprit and the
2 matches
Mail list logo
