I've given up on attempting to get my GJK-EPA algorithm working, and the lack of online resources/penetration depth computation accuracy of MPR leaves me to believe that SAT, while clearly not the most efficient, is the most robust method for convex-convex polyhedra collision detection.

How many vertices can my polyhedra be comprised of before SAT melts my CPU?