On the complexity of 2-output Boolean networks
From MaRDI portal
Cites work
- Complexity of monotone networks for Boolean matrix product
- scientific article; zbMATH DE number 3543939 (Why is no real title available?)
- scientific article; zbMATH DE number 3566175 (Why is no real title available?)
- scientific article; zbMATH DE number 3251176 (Why is no real title available?)
- On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
- Practical decidability
- Realizing Boolean functions on disjoint sets of variables
- Relations Among Complexity Measures
- The complexity of monotone Boolean functions
- The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
- The network complexity and the Turing machine complexity of finite functions
- The Power of Negative Thinking in Multiplying Boolean Matrices
Cited in
(7)- The choice and agreement problems of a random function
- The direct sum of universal relations
- Minimal polynomials for the conjunction of functions on disjoint variables can be very simple
- \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice
- Super-logarithmic depth lower bounds via the direct sum in communication complexity
- Choosing, agreeing, and eliminating in communication complexity
- On the time-space complexity of reachability queries for preprocessed graphs
This page was built for publication: On the complexity of 2-output Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159183)