Computational Complexity of Atomic Chemical Reaction Networks
From MaRDI portal
Publication:5127181
DOI10.1007/978-3-319-73117-9_15zbMath1445.68091arXiv1702.05704OpenAlexW2591343970WikidataQ129709539 ScholiaQ129709539MaRDI QIDQ5127181
Publication date: 21 October 2020
Published in: Natural Computing, SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.05704
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic function computation with chemical reaction networks
- Autocatalysis in reaction networks
- Verification of population protocols
- Reachability, persistence, and constructive chemical reaction networks. II: A formalism for species composition in chemical reaction network theory and application to persistence
- Toric dynamical systems
- A polynomial projection algorithm for linear feasibility problems
- Computation with finite stochastic chemical reaction networks
- A note on transition systems
- Speed faults in computation by chemical reaction networks
- Leaderless deterministic chemical reaction networks
- Computation in networks of passively mobile finite-state sensors
- A Petri net approach to the study of persistence in chemical reaction networks
- Semigroups, Presburger formulas, and languages
- Relationships between nondeterministic and deterministic tape complexities
- Robustness of Expressivity in Chemical Reaction Networks
- Probability 1 Computation with Chemical Reaction Networks
- Rate-independent computation in continuous chemical reaction networks
- On the complexity of integer programming
- `` Strong NP-Completeness Results
- Time-Space Trade-offs in Population Protocols
- An improved version of Chubanov's method for solving a homogeneous feasibility problem
- Computational Complexity of Atomic Chemical Reaction Networks
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
- Space and Energy Efficient Computation with DNA Strand Displacement Systems
- Timing in chemical reaction networks
- Vector addition system reachability problem
This page was built for publication: Computational Complexity of Atomic Chemical Reaction Networks
