文献类型： 会议论文
第一作者： Vladimir Naidenko
作者： Vladimir Naidenko 1 ; Inna Bouriako 2 ; Jean.-Marie Proth 3 ;
作者机构： 1.Institute of Mathematics, NASB Surganov Str., 11, 220012 Minsk, BELARUS
2.Institute of Microbiology, NASB Kuprevich Str., 2, 220141 Minsk, BELARUS
3.INRIA /SAGEP, UFR Scientifique Universite de Metz, He du Saulcy, 57012 Metz cedex 01, FRANCE
关键词： Ecosystems;Models;Computational complexity;NP-completeness;Formal languages;Context-free grammars
会议名称： Strategic management of marine ecosystems /
主办单位：
页码： 159-166
摘要： Algorithmic undecidability of the problem of determining computational complexity of models describing various ecosystems has been proved from a formal language theory point of view.
分类号： Q17
- 相关文献
[1]Quantification of the impact of cover crops on Net Ecosystem Exchange using AgriCarbon-EOv0.1. Soussana J-F,H. Gibrin,M. Ferlicop,Dejoux J-F,E. Ceschia,A. Al Bitar,T. Wijmer,L. Arnaud,R. Fieuzal. 2022
[2]Design & Implementation of Product Recommendation Solution using Sentiment Analysis. Ritu Patidar,Sachin Patel. 2022
