/explore
|
You are here 
|
kevinventullo.com | ||
| | | | |
qchu.wordpress.com
(Part I of this post ishere) Let $latex p(n)$ denote the partition function, which describes the number of ways to write $latex n$ as a sum of positive integers, ignoring order. In 1918 Hardy and Ramanujan proved that $latex p(n)$ is given asymptotically by $latex \displaystyle p(n) \approx \frac{1}{4n \sqrt{3}} \exp \left( \pi \sqrt{ \frac{2n}{3}... |
|
| | | | | ||
| | | | |
cp-algorithms.com
The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection. |
|
| | | | | ||
| | | | |
www.kuniga.me
NP-Incompleteness: |
|
| | | | | ||
| | | | |
phoboslab.org
[AI summary] The author details the development process, technical optimizations, and asset strategies for 'Underrun', a twin-stick shooter entry for the js13kGames JavaScript competition. |
|
| | | |||
