Friday, July 22, 2005

Deterministic problem solving

Have you come across a problem that makes you want to wonder as to how long it will be before the problem will be solved. There are many good books out there on debugging and many many interesting discussions on weird problems and their solutions.

The question for today is

  1. Can we come up with techniques to convert the solution time non-deterministic to deterministic?
  2. How would be verify that these techniques do that effectively?

No comments:

Ranking and Unranking permutations

I've been a big fan of Skiena's Algorithm Design Manual , I recently found my first edition of the book (although I own the third ed...