We analyze the computational complexity of basic reconfiguration problems for the recently introduced surface Chemical Reaction Networks (sCRNs), where ordered pairs of adjacent species nondeterministically transform into a different ordered pair of species according to a predefined set of allowed transition rules (chemical reactions). In particular, two questions that are fundamental to the simulation of sCRNs are whether a given configuration of molecules can ever transform into another given configuration, and whether a given cell can ever contain a given species, given a set of transition rules. We show that these problems can be solved in polynomial time, are NP-complete, or are PSPACE-complete in a variety of different settings, including when adjacent species just swap instead of arbitrary transformation (swap sCRNs), and when cells can change species a limited number of times (k-burnout). Most problems turn out to be at least NP-hard except with very few distinct species (2 or 3).

翻译：我们分析了最近提出的表面化学反应网络（sCRNs）中基本重配置问题的计算复杂性，其中相邻物种的有序对根据预定义的允许转换规则集（化学反应）非确定性地转化为不同的有序物种对。具体而言，对sCRN模拟至关重要的两个问题是：给定一组转换规则，一个给定的分子配置是否能够转化为另一个给定的配置，以及一个给定的细胞是否能够包含一个给定的物种。我们证明，这些问题在不同设置下可以在多项式时间内解决、是NP完全的，或者是PSPACE完全的，这些设置包括相邻物种仅进行交换而非任意转换（交换sCRNs），以及细胞可以有限次改变物种（k-烧尽）。大多数问题至少是NP难的，除非物种数量非常少（2或3种）。