Explore >> Select a destination
|
You are here 
|
opensourc.es | ||
| | | | |
henrikwarne.com
|
|
| | | | | I recently finished the Coursera course Algorithms: Design and Analysis, Part 2 by Professor Tim Roughgarden of Stanford.I've already reviewed part 1, and here are my thoughts on the second part. The main theme of part 1 was the divide and conquer paradigm. In the second part the main themes were greedy algorithms, dynamic programming... | |
| | | | |
matbesancon.xyz
|
|
| | | | | In various graph-related algorithms, a graph is modified through successive operations, merging, creating and deleting vertices. That's the case for the Blossom algorithm finding a best matching in a graph and using contractions of nodes. | |
| | | | |
www.adamconrad.dev
|
|
| | | | | Follow along with Steven Skiena's Fall 2018 algorithm course applied to the JavaScript language. | |
| | | | |
mkatkov.wordpress.com
|
|
| | | Edit 6.6.2016. Premature optimization is a source for errors. The following is completely wrong. Would like to smoke the same thing again. Linear algebra does not work here. We need characterization of quotient space. What I do not understand is why fast methods are working modulo number itself, but not other prime numbers. Suppose we... | ||
