7 Complexity Theory

7 Complexity Theory - IEE 598 - Lecture 11 (I.5) Complexity...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
IEE 598 - Lecture 11 (I.5) Complexity Theory Muhong Zhang DEPARTMENT OF INDUSTRIAL ENGINEERING Feb. 24, 2009
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Complexity Theory How to measure an ”efficient algorithm”? What kind of problems are ”hard” and what are ”easy”? Zhang IEE 376 Introduction to OR 2 / 1
Background image of page 2
Decision Problem In complexity theory, we address the ”decision problem”. A decision problem or feasibility problem is a problem for which the answer is either yes or no . For an optimization problem: max { c ( x ) : x S } , the corresponding decision problem is Is there an x S with value c ( x ) k ? Example: Traveling salesman problem (TSP) Given a graph G = ( V , A ) and traveling time c ij for all ( i , j ) A . Optimization problem: Determine the tour from one city, visiting every city exactly once and back to the city with the smallest total time. Decision problem: For a given constant K , determine whether there is a tour from one city, visiting every city exactly once and back to the city with the total time at most K . Zhang IEE 376 Introduction to OR 3 / 1
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Roughly speaking, a problem is a specified input and output relationship. An instance of a problem consists of the input needed to compute a solution to the problem. An algorithm is a tool/method to solve a well-specified computational problem. Example: Consider the model and data in OPL, their relationship is similar to the relationship between a problem and an instance. The method used by OPL is an algorithm for the problem. The size of an instance is the length of the input of the binary representation. For example: In the TSP problem, the size of an instance is
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 16

7 Complexity Theory - IEE 598 - Lecture 11 (I.5) Complexity...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online