In the context of computational complexity, the problem $$coloring a world map using red, blue, green colors so that no adjacent countries share the same color$$ is called $$hard$$ because it is currently unknown whether or not it can be solved efficiently.