Complexity of fixed point counting problems in Boolean networks (Q2119407): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2022.01.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3111725170 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2012.02513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3370795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous threshold networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum number of fixed points in regulatory Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points and maximal independent sets in AND-OR networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum number of fixed points in AND-OR-NOT networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of maximum fixed point problem in Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of limit-cycle problems in Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Boolean automata circuits dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fixed point approach for stable networks and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative Boolean systems with generically long attractors I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative Boolean systems with generically long attractors. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new necessary condition on interaction graphs for multistationarity / 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: Linear network coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pólya's permanent problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of feedback set problems in signed digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological fixed points in Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of a combinatorial fixed point theorem of Shih and Dong / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points and connections between positive and negative cycles in Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive and negative cycles in Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanents, Pfaffian orientations, and even directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2022.01.004 / rank
 
Normal rank

Latest revision as of 03:08, 17 December 2024

scientific article
Language Label Description Also known as
English
Complexity of fixed point counting problems in Boolean networks
scientific article

    Statements

    Complexity of fixed point counting problems in Boolean networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2022
    0 references
    complexity
    0 references
    Boolean networks
    0 references
    fixed points
    0 references
    interaction graph
    0 references
    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
    0 references
    0 references