Mark Gritter (markgritter) wrote,
Mark Gritter

Knuth on Combinatorial Algorithms

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.
Tags: algorithm, combinatorics, complexity, programming, theory
  • Post a new comment


    default userpic

    Your reply will be screened

    Your IP address will be recorded 

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.
  • 1 comment