Proving polynomial-time for sphere-constrained quadratic programming