| P Class Problem: | Kr Problem which can be solved on polynomial time is known es P-Class Problem. Ex: All sorting and searching algorithms. fc Class Problem: (A Problem which cannot be solved on polynomial time but is) verified in polynomial time is known as Non Deterministic eal or NP-Class Problem. | Ex: Su-Do-Ku, Prime Factor, Scheduling, Travelling SalesmanThe NP Class Problems, it is verified in polynomial time. Es P Class Problems, not only it is solved on Pitnien) time but it is verified also in polynomial time. NP Class ~ (Tere Hard to Solve Easy to Solve co co Easy to Verify Easy to Verify Exponential Polynomial time iia Tractable | e al geCete=)] o){<)| If you can prove P = NP Then Information security or online security is vulnerable to attack, Everything become more efficient such as Transportation, Scheduling, understanding DNA etc. If you can prove P # NP Then You can prove that there are some problems that can never be solved.fer Polynomial Time ‘Let A and B are two problems reunion Wer icconcn) problem B iff there is a way to solve A by deterministic WeLColai tala Mc AFeLeeCo) mS ee) AeA i is reducible to B we denote it by A x BIf Problem A is Decision, Problem and Problem B is (O}e}ainnlrzclatela) Problem then it is possible A o B. NP — Complete Ex : Knapsack Decision Problem can be converted to Knapsack Optimization ‘Problem. y) NP Complete Problem: Decision Problems NP Hard econ Optimization ProblemsIf Problem A is Decision) Problem and Problem B is Optimization Problem then it is possible A « B. NP —Complete NP Complete Problem: . Decision Problems All NP-Complete Problems are NP- Hard but all NP- 7 Hard Problems are not NP- NP Hard fps Complete Optimization ProblemsComputational Complexity Problem | NP-Class NP-Hard | NP-Complete