Preview

Computational Complexity Theory and Polynomial Time

Good Essays
Open Document
Open Document
1105 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Computational Complexity Theory and Polynomial Time
Intractable Problems Intractable Problems The Classes P and NP
Mohamed M. El Wakil Mohamed M. El Wakil mohamed@elwakil.net

1

Agenda
1. 2. 3. 4. 5. 5 What is a problem? Decidable or not? Decidable or not? The P class The NP Class The NP Complete class The NP‐Complete class

2

What is a problem? What is a problem?
• A problem is a question to be answered.
– What is the value of X/Y?

• A problem usually has parameters. p y p
– X, and Y

• A decision problem is a version of the A decision problem, is a version of the problem with only two possible answers: Yes or No! or No!
– Given two numbers X, and Y, does Y evenly divide X?

• An instance: a specific problem instance
– Does 3 evenly divide 6?
3

Decidable or not? Decidable or not?
• A decidable problem, is a problem that could be solved using a computer. • A An undecidable problem, is a problem that d id bl bl i bl th t can never be solved using a computer, neither now or in the future. • Only decidable problems!
4

Classification
• We need to classify problems in terms of their p y computability. • Th Three classes: l
– P class – NP Class – NP‐Complete class NP‐Complete class

5

P class, wrt P class wrt Computers
• Problems with at least one algorithm that solves the problem in polynomial time wrt to l h bl i l i l i the input size. • Polynomial time Polynomial time
– The number of steps needed relates polynomially to the size of the input. to the size of the input – O(n2), O(n9), O(nc), where c is a constant. – but NOT O(n!) O(2n) when n is the size of the but NOT O(n!), O(2 ), when n is the size of the input.
6

P class, wrt Turing Machines P class wrt Turing Machines
• Problems solvable in polynomial time using a Deterministic Turing Machine (DTM) belong to D t i i ti T i M hi (DTM) b l t the class P. • Polynomial time
– The number of moves needed relates polynomially to the size of the input.
• n2, 17n3, 9n4, but NOT 2n

• DTM
– A

You May Also Find These Documents Helpful

  • Good Essays

    Mat 540 Quiz

    • 3185 Words
    • 13 Pages

    138. The systematic problem solving model (myrick) consists of four key questions. Which of the following is not one of them? (what or who)…

    • 3185 Words
    • 13 Pages
    Good Essays
  • Good Essays

    Choose between these two groups of problems, noting that there are two problems in each group:…

    • 918 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Business Quiz Week 4

    • 2199 Words
    • 9 Pages

    | (TCO 1) A conscious choice made from among two or more alternatives is called a…

    • 2199 Words
    • 9 Pages
    Satisfactory Essays
  • Powerful Essays

    the problems associated with the processing and storage of the information gathered. Rather, they only…

    • 2748 Words
    • 11 Pages
    Powerful Essays
  • Powerful Essays

    • Very important: present the problems in exactly the same order as they are listed.…

    • 1402 Words
    • 6 Pages
    Powerful Essays
  • Satisfactory Essays

    Chapter 3

    • 471 Words
    • 2 Pages

    4. With respect to the general classes of computers, a _________ is the most expensive and most powerful kind of computer, which is used primarily to assist in solving massive scientific problems…

    • 471 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    The first topic to be introduced is the information processing theory. It was first introduced by Newell and Simon (1972; cited in Anderson, 1993, p.35) it provided a better understanding of human problem solving in everyday life. Information processing theory proposes that in order to solve a problem, the problem solver must process the information that is available to them i.e. what the problem is and what is required in order to solve the problem. It is thought that problems contain initial state; what the problem is, the goal; what is the outcome of the problem you want to achieve and the operators; what is required or the steps used to achieve the goal. For instance, a student has a problem which is they have 3 assignments due in the same month which is the initial state the goal would be to hand all the assignments in on time and the operators would be delegating time to each assignment accordingly to be able to achieve the goal. However there is also an aspect of the environment that needs to be considered known as the operator restrictions, such as in the example above there may be factors…

    • 2154 Words
    • 9 Pages
    Powerful Essays
  • Better Essays

    Algebra, some of us fear it while some of us embrace it, algebra is not “arithmetic with letters” it is better described as a way of thinking. At its most fundamental level, arithmetic and algebra are two different forms of thinking about numerical issues. Many of these examples have been taken from our classroom discussions while others are examples I have discovered in my own research for this paper, several examples of each will be cited.…

    • 2896 Words
    • 12 Pages
    Better Essays
  • Good Essays

    Bus 1402 Assignment 4

    • 820 Words
    • 4 Pages

    In this assignment you are required to an article and then answer the following questions (in a Word Document) within the context of the framework on Problem-solving discussed in class (total 50 points):…

    • 820 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    MS2 Assignment1

    • 1704 Words
    • 6 Pages

    2. For a system that is intended to solve a problem that is difficult to define precisely…

    • 1704 Words
    • 6 Pages
    Powerful Essays
  • Powerful Essays

    Modericsn Phys

    • 561 Words
    • 3 Pages

    Homework: Only two problems of each chapter will be graded and that will constitute the grade gotten for that particular chapter. The two problems will be chosen at random and so students are expected to hand in all the assigned homework problems. Homework must be handed-in two classes after the end of the corresponding chapter is covered in…

    • 561 Words
    • 3 Pages
    Powerful Essays
  • Powerful Essays

    Scm 372

    • 2623 Words
    • 11 Pages

    the kind of problems you may encounter in exams. Please spend time understanding the practice problems…

    • 2623 Words
    • 11 Pages
    Powerful Essays
  • Good Essays

    CaseStudyBBC

    • 843 Words
    • 4 Pages

    for a problem set). The questions are there to serve as a guide to arrive at the solution of…

    • 843 Words
    • 4 Pages
    Good Essays
  • Good Essays

    assign

    • 508 Words
    • 3 Pages

    6. What is a problem? Give an example of a business problem and discuss how a computer…

    • 508 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Assignment2 Fall 2013

    • 795 Words
    • 5 Pages

    4. There are five problems in total (A.1, A.2, A.3, B, and C). Therefore, your MS Excel file…

    • 795 Words
    • 5 Pages
    Powerful Essays