Scribd
Upload
98 views

Assignment No 2

This document discusses assessing the feasibility of a problem statement on steganography using reversible texture synthesis. It provides definitions for complexity classes like P, NP, NP-hard, and NP-complete and determines that the given problem statement falls into the P or polynomial time class. It then presents a mathematical model that defines the problem statement, input/output data, and constraints using sets like the set of users and different types of steganography.

Uploaded by

aparnajanwalkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
98 views

Assignment No 2

This document discusses assessing the feasibility of a problem statement on steganography using reversible texture synthesis. It provides definitions for complexity classes like P, NP, NP-hard, and NP-complete and determines that the given problem statement falls into the P or polynomial time class. It then presents a mathematical model that defines the problem statement, input/output data, and constraints using sets like the set of users and different types of steganography.

Uploaded by

aparnajanwalkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment No.

2
Aim: Project problem statement feasibility assessment:.
Problem Statement: Steganography Using Reversible Texture Synthesis

Project problem statements feasibility assessment using NP-Hard, NP-Complete and


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

P- Problem:
A problem is assigned to the P (polynomial time) class if there exists at least one
algorithm to solve that problem, such that the number of steps of the algorithm is
bounded by a polynomial in O(n), where n is the size of the input.

NP-Problem:
A problem is assigned to the NP (nondeterministic polynomial time) class if it
is solvable in polynomial time by a nondeterministic Turing machine.
NP-Hard:
A problem is said to be NP-hard if an algorithm for solving it can be translated
into one for solving any other NP-problem. It is much easier to show that a
problem is NP than to show that it is NP-hard.
NP-Complete:
A problem which is both NP and NP-hard is called an NP-complete problem.
On the basis of the above definitions, our problem statement is solvable in polynomial time by deterministic Turing machine hence it is said to be P-Problem.

Mathematical Model:
The mathematical model is illustrated properly that defines the problem
statement of project, input data, output data and all the necessary constraints
regarding project. Solution perspective for proposed scheme,
Mathematical model:

Let S= {U,IS,AS,VS,V};
Where, U= USER (infinite set).
Ex.- U={U1,U2,U3,U4 Un}
IS=Image Steganography
AS=Audio Steganography
Vs=Video Steganography
V=VIEW

You might also like