It is not the case that A factorization witness for n only needs to list factors once each; even with many small primes, encoding k factors takes O(k log n) bits, which is polynomial in log n when k is bounded by log n.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.