Integer Programming 2013 1 I.5. Computational Complexity  Nemhauser and Wolsey, p 114 - Ref: Computers and Intractability: A Guide to the Theory of NP-

Slides:



Advertisements
Similar presentations
Part VI NP-Hardness. Lecture 23 Whats NP? Hard Problems.
Advertisements

Time Complexity P vs NP.
What is Intractable? Some problems seem too hard to solve efficiently. Question 1: Does an efficient algorithm exist?  An O(a ) algorithm, where a > 1,
The class NP Section 7.3 Giorgi Japaridze Theory of Computability.
NP-complete and NP-hard problems Transitivity of polynomial-time many-one reductions Concept of Completeness and hardness for a complexity class Definition.
1 NP-Complete Problems. 2 We discuss some hard problems:  how hard? (computational complexity)  what makes them hard?  any solutions? Definitions 
Design and Analysis of Algorithms NP-Completeness Haidong Xue Summer 2012, at GSU.
NP Completeness Tractability Polynomial time Computation vs. verification Power of non-determinism Encodings Transformation & reducibilities P vs. NP “Completeness”
02/01/11CMPUT 671 Lecture 11 CMPUT 671 Hard Problems Winter 2002 Joseph Culberson Home Page.
P and NP Sipser (pages ). CS 311 Fall Polynomial time P = ∪ k TIME(n k ) … P = ∪ k TIME(n k ) … TIME(n 3 ) TIME(n 2 ) TIME(n)
P, NP, PS, and NPS By Muhannad Harrim. Class P P is the complexity class containing decision problems which can be solved by a Deterministic Turing machine.
Complexity ©D.Moshkovitz 1 Turing Machines. Complexity ©D.Moshkovitz 2 Motivation Our main goal in this course is to analyze problems and categorize them.
NP-complete and NP-hard problems Transitivity of polynomial-time many-one reductions Definition of complexity class NP –Nondeterministic computation –Problems.
1 Other Models of Computation. 2 Models of computation: Turing Machines Recursive Functions Post Systems Rewriting Systems.
NP-complete and NP-hard problems
Analysis of Algorithms CS 477/677
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture NP-Completeness Jan Maluszynski, IDA, 2007
Fall 2004COMP 3351 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
Chapter 11 Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
CS 461 – Nov. 21 Sections 7.1 – 7.2 Measuring complexity Dividing decidable languages into complexity classes. Algorithm complexity depends on what kind.
Programming & Data Structures
CSCE350 Algorithms and Data Structure
Computational Complexity Polynomial time O(n k ) input size n, k constant Tractable problems solvable in polynomial time(Opposite Intractable) Ex: sorting,
חישוביות וסיבוכיות Computability and Complexity Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AAAA.
Internet Engineering Czesław Smutnicki Discrete Mathematics – Computational Complexity.
Complexity theory and combinatorial optimization Class #2 – 17 th of March …. where we deal with decision problems, finite automata, Turing machines pink.
Lecture 30. P, NP and NP Complete Problems 1. Recap Data compression is a technique to compress the data represented either in text, audio or image form.
Approximation Algorithms
NP-complete Problem Prof. S M Lee Department of Computer Science.
CSCI 2670 Introduction to Theory of Computing December 1, 2004.
Complexity Non-determinism. NP complete problems. Does P=NP? Origami. Homework: continue on postings.
P, NP, and Exponential Problems Should have had all this in CS 252 – Quick review Many problems have an exponential number of possibilities and we can.
CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.
CS848: Topics in Databases: Foundations of Query Optimization Topics covered  Review of complexity.
Lecture 12 P and NP Introduction to intractability Class P and NP Class NPC (NP-complete)
Design and Analysis of Algorithms - Chapter 101 Our old list of problems b Sorting b Searching b Shortest paths in a graph b Minimum spanning tree b Primality.
Integer Programming I.5. Computational Complexity  Nemhauser and Wolsey, p Ref: Computers and Intractability: A Guide to the Theory of NP-
Computer Theory Michael J. Watts
CS 3813: Introduction to Formal Languages and Automata Chapter 14 An Introduction to Computational Complexity These class notes are based on material from.
Copyright © 2012 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Computer Science: An Overview Eleventh Edition by J. Glenn Brookshear Chapter.
Costas Busch - LSU1 Time Complexity. Costas Busch - LSU2 Consider a deterministic Turing Machine which decides a language.
NP-Completeness  For convenience, the theory of NP - Completeness is designed for decision problems (i.e. whose solution is either yes or no).  Abstractly,
1 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
Young CS 331 D&A of Algo. NP-Completeness1 NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and.
Optimization/Decision Problems Optimization Problems – An optimization problem is one which asks, “What is the optimal solution to problem X?” – Examples:
TU/e Algorithms (2IL15) – Lecture 9 1 NP-Completeness NOT AND OR AND NOT AND.
1 1. Which of these sequences correspond to Hamilton cycles in the graph? (a) (b) (c) (d) (e)
Prof. Busch - LSU1 Time Complexity. Prof. Busch - LSU2 Consider a deterministic Turing Machine which decides a language.
Theory of Computational Complexity TA : Junichi Teruyama Iwama lab. D3
CSE 332: NP Completeness, Part II Richard Anderson Spring 2016.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Chapter 10 NP-Complete Problems.
Chapter 12: Theory of Computation
EMIS 8373: Integer Programming
Part VI NP-Hardness.
CSCI 2670 Introduction to Theory of Computing
Other Models of Computation
Computational Complexity
Lecture 19-Problem Solving 4 Incremental Method
I.5. Computational Complexity
Time Complexity We use a multitape Turing machine
1. for (i=0; i < n; i+=2) if (A[i] > A[i+1]) swap(A[i], A[i+1])
CLASSES P AND NP.
NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979.
NP and NP completeness 姚鹏晖
NP Completeness • Tractability • Polynomial time
CSE 589 Applied Algorithms Spring 1999
Instructor: Aaron Roth
Our old list of problems
Presentation transcript:

Integer Programming I.5. Computational Complexity  Nemhauser and Wolsey, p Ref: Computers and Intractability: A Guide to the Theory of NP- Completeness, M. Garey and D. Johnson, 1979, Freeman  Purpose: classification of problems according to their difficulties ( polynomial time solvability). Many problems look similar, but have quite different complexity.  e.g.) Shortest Path Problem (with nonnegative arc weights, arbitrary arc weights). Chinese Postman Problem ( graph undirected, directed, mixed) and TSP. Matching and Node Packing (Stable Set) in graphs. Spanning Tree, Steiner Tree. Uncapacitated Lot Sizing, Capacitated Lot Sizing. Uncapacitated Facility Location, Capacitated Facility Location.

Integer Programming

3 2.Measuring alg efficiency and prob complexity

Integer Programming

5

6 3. Some Problems Solvable in Polynomial Time

Integer Programming

8

9

10

Integer Programming Remarks on 0-1 and Pure-Integer Prog.

Integer Programming

Integer Programming

Integer Programming

Integer Programming Nondeterministic Polynomial-Time Algorithms and NP Problems

Integer Programming

Integer Programming Equivalence of Optimization and Feasibility Problem

Integer Programming

Integer Programming Turing Machine Model  Deterministic Turing Machine : mathematical model of algorithm (refer GJ p.23 - ) Finite State Control …. Read-write head Tape (Deterministic one-tape Turing machine)

Integer Programming

Integer Programming  This DTM program accepts 0-1 strings with rightmost two symbols are zeroes. ( check with ), i. e. it solves the problem of integer divisibility by 4.)

Integer Programming

Integer Programming

Integer Programming Certificate of Feasibility, the Class NP, and Nondeterministic Algorithms  Nondeterministic Turing Machine model Finite State Control …. Read-write head Tape (Nondeterministic one-tape Turing machine) Guessing Module Guessing head

Integer Programming

Integer Programming

Integer Programming

Integer Programming

Integer Programming The Class CoNP

Integer Programming

Integer Programming

Integer Programming

Integer Programming