It is not the case that Modern arbitrary-precision arithmetic and specialized algorithms (FFT multiplication) reduce effective bit-complexity below naive worst-case bounds.
?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.