Complexity results for serial decomposability

Chalasani et al. show that this problem is Korf (1985) presents a method for learning macrooperators in NP, but NPcompleteness is open. Tadepalli (1991a, and shows that the method is applicable 1991b) shows how macro tables are polynomially PAClearnable to serially decomposable problems.