Efficient computation of Rt sets

Determine whether the sets Rt = { h(t) | h ∈ H𝓝 }, where H𝓝 is the set of all possible trajectories of a given hybrid gene regulatory network 𝓝, can be computed efficiently, and if so, develop an algorithm with a provable complexity bound.

Background

Beyond understanding the qualitative asymptotics of Rt, there is a computational question about whether these time-slice reachable sets can be computed or approximated efficiently in HGRNs, which would be valuable for verification and reachability analysis.

The authors explicitly ask about the algorithmic tractability of computing Rt.