#### Polynomial time reducibility, NP-hard and NP-complete, Complexity P & NP

Polynomial time reducibility, NP-hard and NP-complete:

We add up some formal definitions to the common concept of problem reduction.

Definition: The function f: A* -> A* is a polynomial-time computable if and only if there is a polynomial p and a DTM M that, when started with w on its tape, halts with the f(w) on its tape, and tM( w ) ≤ p( |w|).

Definition: L is a polynomial-time reducible to L’, represented by L ≤p L’ if and only if there is polynomial-time computable f: A* -> A* in such a way that ∀w ∈ A*, w ∈ L if and only if f(w) ∈ L’.

In another words, the question w ∈ L? Can be answered by deciding the f(w) ∈ L’. Therefore, the complexity of deciding membership in L is utmost the complexity of computing f plus the complexity of deciding the membership in L’.

As we generously avoid polynomial times, this justifies the notation L ≤p L’.

The remarkable fact makes the theory of NP fascinating and rich. With respect to class NP and the notion of polynomial-time reducibility, there are ‘toughest problems’ in the sense that all the decision problems in NP are reducible to any one of such ‘toughest problems’.

Definition: L’ is NP-hard if and only if ∀L ∈ NP, L ≤p L’
Definition: L’ is NP-complete if and only if L’ ∈ NP and L’ is NP-hard

Latest technology based Theory of Computation Online Tutoring Assistance

Tutors, at the www.tutorsglobe.com, take pledge to provide full satisfaction and assurance in Theory of Computation help via online tutoring. Students are getting 100% satisfaction by online tutors across the globe. Here you can get homework help for Theory of Computation, project ideas and tutorials. We provide email based Theory of Computation help. You can join us to ask queries 24x7 with live, experienced and qualified online tutors specialized in Theory of Computation. Through Online Tutoring, you would be able to complete your homework or assignments at your home. Tutors at the TutorsGlobe are committed to provide the best quality online tutoring assistance for Theory of Computation Homework help and assignment help services. They use their experience, as they have solved thousands of the Theory of Computation assignments, which may help you to solve your complex issues of Theory of Computation. TutorsGlobe assure for the best quality compliance to your homework. Compromise with quality is not in our dictionary. If we feel that we are not able to provide the homework help as per the deadline or given instruction by the student, we refund the money of the student without any delay.