I am looking for problems which have an algorithm with asymptotically optimal exponential computational complexity or the problem has a lower bound of exponential computational complexity for algorithms to solve the problem.I am not looking for problems, where this is implied because the solution can be exponential in size.If you know any, it would be very kind if you can share it with me.
Problems with exponential lower computational complexity bound
complexity classes