Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems (Q2948456): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Elements of a theory of simulation. II: Sequential dynamical systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of reachability problems for finite discrete dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-witnessing polynomial-time complexity and prime factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3350759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy results for fixed-point existence problems for Boolean dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence relations on finite dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy results for fixed point counting in Boolean dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 20:01, 10 July 2024

scientific article
Language Label Description Also known as
English
Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems
scientific article

    Statements

    Identifiers