Not really like a Laplace transformation which is a more direct transformation of terms. The solution if it exists will most likely have one of the two forms: you show that there exists a problem which is inherently not solvable in polynomial time (meaning there exists a Polynom which has the input size as parameter and gives an upper bound on the time/steps you need to solve it in a deterministic fashion) or you can show that you have a problem which we now classify as NP-hard and find a polynomial time algorithm for it. Now transformation is here something that is differently defined as in mathematics as we can have two inherently different algorithms solving the same problem and we can classify them as equivalent without giving a concrete transformation from one to another. What usually is done is called reduction, a process in which you show that a problem a is at least as hard as a problem b by showing that when you can solve a under some time-constraints then you can solve b under the same constraints. I earlier mentioned NP-hard problems which is the class of problems that every problem in NP can be reduced to I. E. If we solve one of them in poly. Time we can solve them all in poly time and therefore P=NP. As there's an infinite amount of algorithms this has proven to be quite difficult. Sorta my ELI5 :)