/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 cp-algorithms.com
Continued fractions - Algorithms for Competitive Programming
| | blog.demofox.org
Irrational Numbers « The blog at the bottom of the sea
3.7 parsecs away

Travel
| | An irrational number is a number that can't be represented as a fraction using integers for the numerator and denominator. I'm a big fan of irrational numbers, and one of the biggest reasons for that is that they are great at making low discrepancy sequences, which give amazing results when used in stochastic (randomized) algorithms,...
| | www.jeremykun.com
Elliptic Curve Diffie-Hellman | Math Programming
3.8 parsecs away

Travel
| | So far in this series we've seen elliptic curves from many perspectives, including the elementary, algebraic, and programmatic ones. We implemented finite field arithmetic and connected it to our elliptic curve code. So we're in a perfect position to feast on the main course: how do we use elliptic curves to actually do cryptography? History As the reader has heard countless times in this series, an elliptic curve is a geometric object whose points have a surprising and well-defined notion of addition.
| | adrianmejia.com
8 time complexities that every programmer should know | Adrian Mejia Blog
4.0 parsecs away

Travel
| | JavaScript tutorials and web development articles including topics like NodeJS, Angular, VueJS, Data Structures and Algorithms.
| | dominiczypen.wordpress.com
Making critical graphs as regular as possible | Musings on general topology and orderings
42.1 parsecs away

Travel
| Suppose you want to have a graph $latex G = (V,E)$ with chromatic number $latex \chi(G)$ equaling some value $latex k$, such that $latex G$ is minimal with this property. So you end up with a $latex k$-(vertex-)critical graph. It is easy to construct critical graphs by starting with some easy-to-verify example like $latex C_5$...