O(logN)Sublinear课程.pptVIP

Problem Complexity and NP-Complete Problems Presented by Ming-Tsung Hsu Problem Complexity Overview Complexity theory Part of the theory of computation Dealing with the resources required to solve a given problem time (how many steps it takes to solve a problem) space (how much memory it takes) Computational difficulty of computable functions Relations between Problems, Algorithms, and Programs Time Complexity Number of steps that it takes to solve an instance of the problem Function of the size of the input Using the most efficient algorithm Exact number of steps will depend on exactly wha