Computer Science

TwitterFacebook
Get flash to fully experience Pearltrees

-= 10 Technical Papers Every Programmer Should Read (At Least Twice) =-

10 Technical Papers Every Programmer Should Read (At Least Twice) http://blog.fogus.me/2011/09/08/10-technical-papers-every-programmer-should-read-at-least-twice/
Guru of the Week is a regular series of C++ programming problems created and written by Herb Sutter . Since 1997, it has been a regular feature of the Internet newsgroup comp.lang.c++.moderated , where you can find each issue's questions and answers (and a lot of interesting discussion).

Guru of the Week (GotW) Archive - Main Index Page

http://gotw.ca/gotw/index.htm
http://blog.wolframalpha.com/2011/02/21/complexity-classes-in-wolframalpha/ Posted by An algorithm is, in essence, a procedure given by a finite description that solves some computational problem.

Complexity Cases in Wolfram

Figure 1: A heuristic solution to the Traveling Salesman Problem is to visit the points in the same sequence as the Sierpinski spacefilling curve. A spacefilling curve is a continuous mapping from a lower-dimensional space into a higher-dimensional one.

Bartholdi on spacefilling curves

http://www2.isye.gatech.edu/~jjb/mow/mow.html