Computationally Hard

1) Describe what it means for a problem to be “computationally hard.”
A problem is computationally hard if there is no algorithm to solve it and it must be done with brute force.
2) What strategies do people use to solve large computationally hard problems?
They often look for the best starting point which ,makes the rest slightly easier.
3) Why are computationally hard problems important in encryption strategies?
They are important because they make things and messages more secure because they are harder for computers to automatically decrypt.