Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

NP-complete computational problems

The above example is convenient for illustration because it is relatively small and involves only uni-unimolecular reactions. For large systems with arbitrary reaction stoichiometry, it turns out that the assignment of feasible reactions is an NP-complete computational problem [216], Therefore, application of thermodynamic constraints in genome-scale problems is an area of ongoing research. [Pg.234]


See other pages where NP-complete computational problems is mentioned: [Pg.40]    [Pg.33]    [Pg.2751]   
See also in sourсe #XX -- [ Pg.33 , Pg.48 ]




SEARCH



Computational problems

NP-complete

NP-completeness

© 2024 chempedia.info