This paper demonstrates, despite the theoretical intractability, many real problem instances for robust point cloud registration can be solved exactly and quickly (seconds to minutes) with our maximum clique algorithm, which makes our approach an excellent alternative to standard robust techniques for 3D registration.