Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Jacobi
on Dec 13, 2012
|
parent
|
context
|
favorite
| on:
The Mathematical Hacker
I think that it can be implemented in constant time for floating point numbers. For integers I know that the exponentiation by squaring takes O(log(n))
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: