Next:
Introduction to Complexity
Introduction to Complexity
Who cares?
Properties of Algorithms
Space and Time
The Little-O measure
The Big-O measure
The
measure
Complexity Classes
P
NP
Reducibility
NP-COMPLETE and NP-HARD
Satisfiablity and Cook's Theorem
Tractability
P = NP
Abstract Complexity
Some Problems
Further Reading
About this document ...
Menaka Lashitha Bandara 2005-04-18