Mar 30, 2013 21:19
From "Combinatorial Analysis and Computers", February 1965:
When the size of a combinatorial problem grows very rapidly, we can usually expect the computer to do only about one case larger than can be done by hand.
I am curious whether there are readily-available examples where this is still true.
algorithm,
theory,
complexity,
combinatorics,
programming