At 11:47 AM 11/4/98 -0200, Nicolau Corcao Saldanha wrote:
>> is something line O( n^2 log(n) log(log(n)) ).
>
>This is probably a typo: with FFT or similar methods multiplication time
>is aproximately O( n log(n) log log(n) ).

That's right - my error.



+------------------------------------------+
| Jud McCranie [EMAIL PROTECTED] |
+------------------------------------------+

Reply via email to