"On Computational Complexity of Automorphism Groups in Classical Planning."

Alexander Shleyfman (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics