Raising numbers to large powers is still O(log n), though. Even if it's a single... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		ajkjk on Dec 26, 2014 \| parent \| context \| favorite \| on: Using the Quick Raise of Matrices to a Power to Wr... Raising numbers to large powers is still O(log n), though. Even if it's a single term when written out as an equation.

ivansavz on Dec 26, 2014 [–]

Thx for pointing this out. I updated the comment. It seems O(log n) is as low as it will go, still I find it to be a neat (theoretical) trick.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact