Download presentation

Presentation is loading. Please wait.

Published byZavier Gaillard Modified over 3 years ago

1
Fall 2006Costas Busch - RPI1 Time Complexity

2
Fall 2006Costas Busch - RPI2 Consider a deterministic Turing Machine which decides a language

3
Fall 2006Costas Busch - RPI3 For any string the computation of terminates in a finite amount of transitions Accept or Reject Initial state

4
Fall 2006Costas Busch - RPI4 Accept or Reject Decision Time = #transitions Initial state

5
Fall 2006Costas Busch - RPI5 Consider now all strings of length = maximum time required to decide any string of length

6
Fall 2006Costas Busch - RPI6 Max time to accept a string of length STRING LENGTH TIME

7
Fall 2006Costas Busch - RPI7 Time Complexity Class: All Languages decidable by a deterministic Turing Machine in time

8
Fall 2006Costas Busch - RPI8 Example: This can be decided in time

9
Fall 2006Costas Busch - RPI9 Other example problems in the same class

10
Fall 2006Costas Busch - RPI10 Examples in class:

11
Fall 2006Costas Busch - RPI11 Examples in class: CYK algorithm Matrix multiplication

12
Fall 2006Costas Busch - RPI12 Polynomial time algorithms: Represents tractable algorithms: for small we can decide the result fast constant

13
Fall 2006Costas Busch - RPI13 It can be shown:

14
Fall 2006Costas Busch - RPI14 The Time Complexity Class tractable problems polynomial time algorithms Represents:

15
Fall 2006Costas Busch - RPI15 CYK-algorithm Class Matrix multiplication

16
Fall 2006Costas Busch - RPI16 Exponential time algorithms: Represent intractable algorithms: Some problem instances may take centuries to solve

17
Fall 2006Costas Busch - RPI17 Example: the Hamiltonian Path Problem Question: is there a Hamiltonian path from s to t? s t

18
Fall 2006Costas Busch - RPI18 s t YES!

19
Fall 2006Costas Busch - RPI19 Exponential time Intractable problem A solution: search exhaustively all paths L = { : there is a Hamiltonian path in G from s to t}

20
Fall 2006Costas Busch - RPI20 The clique problem Does there exist a clique of size 5?

21
Fall 2006Costas Busch - RPI21 The clique problem Does there exist a clique of size 5?

22
Fall 2006Costas Busch - RPI22 Example: The Satisfiability Problem Boolean expressions in Conjunctive Normal Form: Variables Question: is the expression satisfiable? clauses

23
Fall 2006Costas Busch - RPI23 Satisfiable: Example:

24
Fall 2006Costas Busch - RPI24 Not satisfiable Example:

25
Fall 2006Costas Busch - RPI25 Algorithm: search exhaustively all the possible binary values of the variables exponential

26
Fall 2006Costas Busch - RPI26 Non-Determinism Language class: A Non-Deterministic Turing Machine decides each string of length in time

27
Fall 2006Costas Busch - RPI27 Non-Deterministic Polynomial time algorithms:

28
Fall 2006Costas Busch - RPI28 The class Non-Deterministic Polynomial time

29
Fall 2006Costas Busch - RPI29 Example: The satisfiability problem Non-Deterministic algorithm: Guess an assignment of the variables Check if this is a satisfying assignment

30
Fall 2006Costas Busch - RPI30 Time for variables: Total time: Guess an assignment of the variables Check if this is a satisfying assignment

31
Fall 2006Costas Busch - RPI31 The satisfiability problem is an - Problem

32
Fall 2006Costas Busch - RPI32 Observation: Deterministic Polynomial Non-Deterministic Polynomial

33
Fall 2006Costas Busch - RPI33 Open Problem: WE DO NOT KNOW THE ANSWER

34
Fall 2006Costas Busch - RPI34 Example: Does the Satisfiability problem have a polynomial time deterministic algorithm? WE DO NOT KNOW THE ANSWER Open Problem:

Similar presentations

OK

Fall 2003Costas Busch - RPI1 Decidability. Fall 2003Costas Busch - RPI2 Recall: A language is decidable (recursive), if there is a Turing machine (decider)

Fall 2003Costas Busch - RPI1 Decidability. Fall 2003Costas Busch - RPI2 Recall: A language is decidable (recursive), if there is a Turing machine (decider)

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on ms excel 2010 Ppt on united nations and its various organs Ppt on mental health nursing Ppt on duty roster for camping Ppt on atrial septal defect murmur Ppt on chromosomes and genes diagram Ppt on partnership act 1932 rules Ppt on speed control of dc shunt motor Ppt on the art of war author Ppt on fair and lovely cream