It is not the case that A prime factorization of n with no factor less than m serves as a polynomial-size certificate for non-membership in FACTORIZATION, and primality of factors is verifiable in polynomial time via AKS
?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.