\(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice
From MaRDI portal
Publication:1904667
DOI10.1007/BF01268142zbMath0838.68039OpenAlexW2025523787MaRDI QIDQ1904667
Mike S. Paterson, Alain P. Hiltgen
Publication date: 27 May 1996
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01268142
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of slice functions
- Lower bounds on monotone complexity of the logical permanent
- More on the complexity of slice functions
- The complexity of central slice functions
- The monotone circuit complexity of Boolean functions
- On monotone simulations on nonmonotone networks
- Some remarks on Boolean sums
- A new lower bound on the monotone network complexity of Boolean sums
- On another Boolean matrix
- On the complexity of 2-output Boolean networks
- On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
- Realizing Boolean functions on disjoint sets of variables
- On the combinational complexity of certain symmetric Boolean functions
- Complexity of Monotone Networks for Computing Conjunctions
- Negation is Powerless for Boolean Slice Functions
This page was built for publication: \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice
