A product of factor bit-lengths is still bounded by O((log n)²), not exceeding the polynomial bound ...
This proposition has not been edited since the history system was added.