Floating-Point Multi/Div Algorithms-Time Complexity

Hello,
Does anyone have an idea of the Order-of time Complexity
for floating point Mult or Div. I suspect it is O()log(n)),
but I cannot find any literature to back that up..and I have searched...!

Thanks

This generally is not something programmers worry about nowadays - chip makers do the work. Floating point operations are actually machine level instructions for Intel and AMD primary cpu chips. For RISC machines that may not be true, like HPUX Vclass machines.

This is not exactly what you want but it pertains in that it shows the development over time of better algorithms for a simple math operation.

http://www.azillionmonkeys.com/qed/sqroot.html

Plus swox is active in extended precision floating point operations -

http://swox.com/gmp/

And there are some discussions there that do relate to your question.