Assertion: algorithm's time | /r/CapableOf | need for multiplication
Facets:
Source sentences:
text: It results that, for large integers, the computer time needed for a division is the same, up to a constant factor, as the time needed for a multiplication, whichever multiplication algorithm is used.