Algorithm to find the distinct representations of the integer $n$ as a sum of $k$ non-negative p^(th) integer powers.

Question

I am a user of Wolfram Mathematica and in that software there is a function called: PowersRepresentations. This function returns lists of integers $0\le n_1\le n_2\le\dots\le n_k$ such that $n_1^p+n_2^p+\dots+n_k^p=n$

Question: what algorithm does Mathematica uses to found the PowersRepresentations of a number.

---

I know that when dealing with sums of just integers (so not powers) we can use the Partition function found by Srinivasa Ramanujan. But is there also a formula/algorithm for the PowersRepresentations of a number?