We show the NP-hardness of the reachability and mortality problems for a three dimensional variant of Piecewise Constant Derivative (PCD) system called a ...
Reachability and Mortality Problems for Restricted Hierarchical ...
link.springer.com › content › pdf
Abstract. We show the NP-hardness of the reachability and mortality problems for a three dimensional variant of Piecewise Constant Deriva-.
Abstract. We show the NP-hardness of the reachability and mortality problems for a three dimensional variant of Piecewise Constant Derivative (PCD) system ...
Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives. Work. HTML. Year: 2014. Type: book-chapter.
Feb 6, 2020 · Paul C. Bell, Shang Chen, Lisa M. Jackson: Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives.
We study the complexity of reachability and mortality problems for variants of RHPCDs and show a variety of results, depending upon the allowed powers.
In this paper, we show a restriction of HPCDs (called RHPCDs) which leads to the reachability problem becoming decidable. We then study which additional powers ...
Missing: Mortality | Show results with:Mortality
Sep 25, 2024 · This study focuses on the computational complexity of the reachability and mortality problems for two-dimensional hierarchical piecewise ...
Sep 4, 2021 · We show that the reachability problem and the mortality problem are co-NP-hard for bounded 3-dimensional RHPCDs (3-RHPCDs). Reachability is ...
We study the complexity of reachability and mortality problems for variants of RHPCDs and show a variety of results, depending upon the allowed powers. These ...