Algorithm08 计算复杂性理论简介.pptx

计算复杂性理论简介内 容引言“算法”与“好的算法”图灵机NP完全问题NP难问题如何处理NP 完全问题、 NP难问题新的计算模型与希望1. 引言 - The 1st story…The boss wants to produce programs to solve the following two problems Euler circuit problem:given a graph G, find a way to go through each edge exactly once.Hamilton circuit problem: given a graph G, find a way to go through each vertex exactly once.The two problems seem to be very similar.Person A takes the first problem and person B takes the second.Outcome: Person A quickly completes the program, whereas person B works 24 hours per day and is fired after a few months. 1. 引言 - The 1st story…Euler Circuit: The original Konigsberg bridge1. 引言 - The 1st story…Hamilton circuit 1. 引言 - The 1st story…Explanation: Euler circuit problem can be easily solved in polynomial time.Hamilton circuit problem is proved to be NP-hard. So far, no body in the world can give a polynomial time algorithm for a NP-hard problem.Conjecture: there does not exist polynomial time algorithm for this problem. 1. 引言 - The 2nd story…The “Bandersnatch” problemBackground:You are employed in the halls of industry. One day your boss calls you into his office and confides that the company is about to enter the highly competitive "bandersnatch" market. For this reason, a good method is needed for determining whether or not any given set of specifications for a new bandersnatch component can be met and, if so, for constructing a design that meets them. Since you are the company's chief algorithm designer, your charge is to find an efficient algorithm for doing this. 1. 引言 - The 2nd story…Initial attempt:Pull down your reference books and plunge into the task with great enthusiasm.Some weeks later ...Your office is filled with crumpled-up scratch paper, andyour enthusiasm has lessened considerable because …… the solution seems to be to examine all possible designs!New problem:How do you convey the bad information to your boss?1. 引言 - The 2nd story…Approach #1: Take the loser’s way out"I can't find an eff