It is not the case that AKS runtime is proven polynomial in log(n)—O((log n)⁶) or O((log n)⁴) with improvements—making super-polynomial growth impossible by definition.
?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.