Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws (Q5050755): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Foundations of chemical reaction network theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to modeling biological cellular control systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on chemical reaction network dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Analysis of Biochemical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4784053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing all possible graph structures describing linearly conjugate realizations of kinetic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational approach to the structural analysis of uncertain kinetic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for extinction events in chemical reaction networks with discrete state spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational approach to extinction events in chemical reaction networks with discrete state spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure to decide reachability in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Hierarchies beyond Elementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5157548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of low-order discrete state reaction networks obeying conservation laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservation Laws in Biochemical Reaction Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Dynamical Nonemptiability and Persistence of Chemical Kinetics Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Barvinok Algorithm Based on Irrational Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting integer points in parametric polytopes using Barvinok's rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming, Barvinok's counting algorithm and Gomory relaxations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective lattice point counting in rational convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monomolecular reaction networks: Flux-influenced sets and balloons / rank
 
Normal rank

Revision as of 21:43, 30 July 2024

scientific article; zbMATH DE number 7619569
Language Label Description Also known as
English
Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws
scientific article; zbMATH DE number 7619569

    Statements

    Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws (English)
    0 references
    0 references
    0 references
    17 November 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references