Tutorial on Computational Complexity
Published in Interfaces • Jun 1, 2002
Authors:
Craig A. Tovey
Abstract
Computational complexity measures how much work is required to solve different problems. It provides a useful classification tool for OR/MS practitioners, especially when tackling discrete deterministic problems. Use it to tell, in advance, whether a problem is easy or hard. Knowing this won't solve...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!