How to Find the Exit from a 3-Dimensional Maze

We present several experimental algorithms for fast computation of variadic polynomials over non-negative integers. 2012 ACM Subject Classification Theory of computation → Theory and algorithms for application domains

[1]  D. R. Heath-Brown.  Searching for Solutions of x 3 + y 3 + z 3 = k , 1992 .

[2]  Sums of Four Squares , 1996 .

[3]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[4]  James A. Sellers,et al.  Partitions into three triangular numbers , 2004, Australas. J Comb..

[5]  D. Hilbert,et al.  Beweis für die Darstellbarkeit der ganzen Zahlen durch eine feste Anzahl n ter Potenzen (Waringsches Problem) , 1932 .

[6]  J. Silverman.  Taxicabs and sums of two cubes , 1993 .

[7]  Éva Tardos,et al.  Algorithm design , 2005 .

[8]  E Barker,et al.  Searching for solutions. , 1986, The Journal of neuroscience nursing : journal of the American Association of Neuroscience Nurses.

[9]  Paul Pollack,et al.  Finding the Four Squares in Lagrange's Theorem , 2018, Integers.

[10]  Eugène Catalan,et al.  Démonstration d'un théorème d'arithmétique , 1887 .

[11]  M. Rabin,et al.  Randomized algorithms in number theory , 1985 .