The symbolic regression (SR) problem is NP-hard, as it can be reduced to the NP-hard degree-constrained Steiner Arborescence problem (DCSAP).
