Complexity Theory CS Diviion Home复杂性理论 CS分回家.pptVIP

Complexity Theory A light introduction to a rather important and complex topic. October 12, 2007 Presented by Sean Szumlanski Programme Graph coloring: a practical application This problem will serve as our touchstone throughout the lecture as we attempt to ground our discussion of complexity theory. Key concepts and terms: Polynomial runtime, decision problem, determinism, and reducibility Introduction to problem classes: P, NP, and NP-Complete Implications and further considerations The Map Coloring Problem The Map Coloring Problem Now that we have our graph: K-coloring and its complexity Why hate on non-polynomial runtimes? Toward the study of complexity A preliminary definition The first and most obvious class An interlude on the topic of determinism Approaching non-determinism Where’s the non-determinism? Classes of problems again Problem reducibility A final class of problems Implications and discussion The take-away from today’s lecture * * The Question: What is the minimum number of colors necessary to color this map so that no two bordering countries share the same color? One Approach: Model the map using a graph in a way that allows us to find the answer to this question by finding the chromatic number1 of the graph. 1 Recall: the chromatic number of G, C(G), is the minimum number of colors needed to ensure that no two adjacent vertices in G have the same color. So how can we do this? Now we can proceed to find C(G). Is G 2-colorable? 3-colorable? 4-colorable? What is its min or max degree? Does it have an embedded Kc (complete graph on c vertices)? How do we determine these questions (e.g., whether a graph is 3-, 4-, or K-colorable)? What is the algorithm? How efficient of an algorithm can we discover to answer these questions? How might we begin our inquiry? For arbitrary graphs, even the most efficient algorithms for determining three- or four-colorability (and beyond) essentially come down to this: Try a LOT of combinations! It turns out that