News for hackers. Stuff that matters.

A comment on A new algorithm for graph crossings, hiding in plain sight (2020). Parent comment

Re:A new algorithm for graph crossings, hiding in plain sigh... by potiuper on Wednesday May 26, 2021 @05:33PM (#27296401)
n=nodes>0; n^0.5=(log n)^3, n~24128091.7 , which is millions not billions? https://www.wolframalpha.com/input/?i=sqrt%28n%29%3D%28log+n...
[ Parent | on HN ]
Re:A new algorithm for graph crossings, hiding in plain sigh... by not2b on Wednesday May 26, 2021 @05:52PM (#27296566)
You're using natural log, for my quick-and-dirty I used log2, which gives a slightly higher crossover point. The exact crossover depends on the size of the constant term, of course.
[ Parent | on HN ]
Re:A new algorithm for graph crossings, hiding in plain sigh... by froh on Wednesday May 26, 2021 @11:09PM (#27298926)
https://www.wolframalpha.com/input/?i=sqrt%28n%29%3D%28ld+n%... indeed goes to 620 Mio
[ Parent | on HN ]