Abstract
Extremal combinatorics is the study of the size that a certain collection of objects must have in order to certainly satisfy a property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behaviour of large reaction systems by means of extremal combinatorics. We defined several different properties that capture some basic behaviour of a reaction system and we prove that they must necessarily be satisfied by large enough systems. Explicit bounds and formulae are also provided. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Dennunzio, A., Formenti, E., & Manzoni, L. (2014). Extremal combinatorics of reaction systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8370 LNCS, pp. 297–307). https://doi.org/10.1007/978-3-319-04921-2_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
