Exhaustive Search: CS 306 Lecture notes

Computer Algorithms II Lecture Notes

30 September 2008 • Exhaustive Search


Naturally, this statement requires qualification because this lecture’s about a solution to the file packing problem. The qualification identifies “particular” with “polynomial-time.”


This page last modified on 24 January 2006.