all -type problems are subsets of np problems this means that any problem that can be solved in polynomial time can also be verified in polynomial time but the questionis npinvestigates whether problems that can be verified in polynomial time can also be solved in polynomial time in particularif they are equalit would mean that problems that are solved by trying number of possible solutions can be solved without the need to actually try all the possible solutionsinvariably creating some sort of shortcut proof the proofwhen finally discoveredwill definitely have serious consequences in the fields of cryptographygame theorymathematicsand many other fields