-Np hard
Any given problem X acts as NP-Hard only if
there exists a problem Y that is NP-Complete.
Here, problem Y becomes reducible to problem
X in a polynomial time. The hardness of an NP-
Hard problem is equivalent to that of the NP-
Complete Problem. But here, the NP-Hard
Problems don’t need to be in the NP Class.
-Np complete
Any given problem X acts as NP-Complete when
there exists an NP problem Y- so that the
problem Y gets reducible to the problem X in a
polynomial line. This means that a given problem
can only become NP-Complete if it is a part of
NP-Hard as well as NP Problems. A Turing
machine of non-deterministic nature can easily
solve this type of problem in a given polynomial
time.
-Non d sorting
A non-deterministic algorithm usually has two
phases and output steps. The first phase is the
guessing phase, which makes use of arbitrary
characters to run the problem. The second phase
is the verifying phase, which returns true or false
for the chosen string.
-Non d serching
• In a non-deterministic search algorithm, an
index between 1 to n is generated randomly. If
the key element is found on i-th index then the
algorithm returns success, else returns false.
• Run the algorithm again and observe the
output. As the index i is generated randomly, we
might need to run multiple times before we get
success.
• For the given example, the key to be searched
is 44, and the random index generated is 4. The
element in an array on index 4 is 55, which does
not match with the key index and hence
algorithm returns fail.
• On the right side of the figure, the generated
random index is 2, and the key to be searched is
11. The element on index 2 in the array is 11,
which matches the key element. And hence, the
algorithm will return success.
Cooks thrm
Cook's Theorem proves that satisfiability is N P-complete
by reducing all non-deterministic Turing machines to SAT.
Each Turing machine has access to a two-way infinite
tape (read/write) and a finite state control, which serves
as the program.
A program for a non-deterministic TM is:
1. Space on the tape for guessing a solution and
certificate to permit verification.
2. A finite set of tape symbols
3. A finite set of states O for the machine, including the
start state go and final states Lyes, 4no
4. A transition function, which takes the current machine
state, and current tape symbol and returns the new
state, symbol, and head position.
We know a problem is in NP if we have a NDTM program
to solve it in worst-case time p\~, where p is a
polynomial and n is the size of the input.
Cook's Theorem - Satisfiability is NP-complete!
Proof: We must show that any problem in NP is at least
as hard as SAT. Any problem in NP has a non-
deterministic TM program which solves it in polynomial
time, specifically
We will take this program and create from it an instance
of satisfiability such that it is satisfiable if and only if the
input string was in the language.
If a polynomial time transform exists, then SAT must be
NP-complete, since a polynomial solution to SAT gives a
polynomial time algorithm to anything in NP.
Our transformation will use boolean variables to
maintain the state of the TM:
Since a polynomial time algorithm for SAT would imply a
polynomial time algorithm for everything in NP.SAT is NP-
hard since we cam guess a sloton to SAT, it is in NP and
thus Np-compite therfore now Cook's theorem has been
proved