On the complexity of 2-output Boolean networks (Q1159183): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Practical decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of monotone networks for Boolean matrix product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing Boolean functions on disjoint sets of variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of monotone boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Among Complexity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Negative Thinking in Multiplying Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network complexity and the Turing machine complexity of finite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements / rank
 
Normal rank

Latest revision as of 13:23, 13 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of 2-output Boolean networks
scientific article

    Statements

    Identifiers