Scribd
Upload
160 views

Assignment

The document discusses NP-hard, NP-complete, and P complexity classes. It defines each class, with P containing problems solvable in polynomial time, NP containing problems verifiable in polynomial time, and NP-hard containing problems that are at least as hard as any NP problem. NP-complete problems are NP and NP-hard - meaning they are the hardest problems in NP. The document then provides a mathematical model for a public complaint sorting system using a system diagram and descriptions of inputs, processes, and outputs. It analyzes this system and determines it follows the P class since it involves a finite number of steps to get the output.

Uploaded by

Priyanka Walke
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
160 views

Assignment

The document discusses NP-hard, NP-complete, and P complexity classes. It defines each class, with P containing problems solvable in polynomial time, NP containing problems verifiable in polynomial time, and NP-hard containing problems that are at least as hard as any NP problem. NP-complete problems are NP and NP-hard - meaning they are the hardest problems in NP. The document then provides a mathematical model for a public complaint sorting system using a system diagram and descriptions of inputs, processes, and outputs. It analyzes this system and determines it follows the P class since it involves a finite number of steps to get the output.

Uploaded by

Priyanka Walke
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment No: 2

Aim: Project problem statement feasibility assessment using NP-Hard, NP-Complete or


satisfiability issues using modern algebra and/or relevant mathematical models.

Problem Statement: Project problem statement feasibility assessment using NP-Hard, NP-
Complete or satisfy ability issues using modern algebra and/or relevant mathematical
models.

Theory:

 NP-hard, NP-Complete Analysis:


When solving problems we have to decide the difficulty level of our problem. There are
three types of classes provided for that. These are as follows:
1) P Class
2) NP-hard Class
3) NP-Complete Class

 P Class :
The class of polynomials solvable problems, P contains all sets in which membership may
be decided by an algorithm whose running time is bounded by a polynomial. Besides
containing all of what we have decided to consider practical computational tasks, the class
P has another attractive attribute. Its use allows us to not worry about our machine model
since all reasonable models of computation (including programs and Turing machines)
have time complexities, which are polynomial related.

 NP Class :
Informally the class P is the class of decision problems solvable by some algorithm within a
number of steps bounded by some fixed polynomial in the length of the input. Turing was
not concerned with the efficiency of his machines, but rather his concern was whether they
can simulate arbitrary algorithms given sufficient time. However it turns out Turing
machines can generally simulate more efficient computer models (for example machines
equipped with many tapes or an unbounded random access memory) by at most squaring
or cubing the computation time. Thus P is a robust class and has equivalent definitions over
a large class of computer models. Here we follow standard practice and define the class P in
terms of Turing machines.

 NP Hard :
A problem is NP-hard if solving it in polynomial time would make it possible to solve all
problems in class NP in polynomial time. Some NP-hard problems are also in NP (these are
called "NP-complete"), some are not. If you could reduce an NP problem to an NP-hard
problem and then solve it in polynomial time, you could solve all NP problems. Also, there
are decision problems in NP-hard but are not NP-complete, such as the infamous halting
problem.

 NP-complete :
A decision problem L is NP-complete if it is in the set of NP problems so that any given
solution to the decision problem can be verified in polynomial time, and also in the set of
NP-hard problems so that any NP problem can be converted into L by a transformation of
the inputs in polynomial time. The complexity class NP-complete is the set of problems that
are the hardest problems in NP, in the sense that they are the ones most likely not to be in
P. If you can find a way to solve an NP-complete problem quickly, then you can use that
algorithm to solve all NP problems quickly.
 Mathematical Model:
Let S be the whole System,

 S ={ I, P, O }

I – Input

P – Process

O – Output

 I = { I0, I1, I2 }

I0 = Fire Complaint

I1 = Give Vote to Complaints

I2 = Give Suggestions

 P = { P0, P1, P2, P3, P4, P5 }

P0 = View Complaint

P1 = Generate priority list of issues based on citizen’s vote

P2 = Classify complaints according to department using machine learning

P3 = Send classified complaints to corporator of particular department

P4 = Corporator takes action on fired complaint

P5 = Unsolved issues handled by higher authorities

 O= (O0)

O0 = Issue Solved

Fig 1: Venn Diag.


• Conclusion:
As our project topic is “Public Complaint Sorting Using Image Processing” In this

project, after providing input it follows some finite steps to get the final output. System

is useful for personal use where security is concern. This process also comes under

finite steps. Hence, the proposed system is followed P class.

You might also like