A glance of the paper seems to suggest that they are going back to the traditional RL methods. It would be interesting for the paper to compare with them explicitly.
If you mean they are returning to tabular Q-learning, then yes, sort of. They still use function approximation (as required; tabular Q-learning stands no chance of generalising across states), but their function kind of looks like a table look up. A look up of the 50 closest values to some computed key though.
It would be totally uninteresting to compare this with tabular Q-learning though.