Complexity classes of algorithms. There are only 3 variables in a discrete logarithm problem but it takes super computers to solve. Same with prime number fact

Complexity classes of algorithms. There are only 3 variables in a discrete logarithm problem but it takes super computers to solve. Same with prime number factorization. Number of inputs is completely unrelated to the time to solve depending on the algorithm being used to solve the problem.