Realizing Boolean functions on disjoint sets of variables
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3172224 (Why is no real title available?)
- scientific article; zbMATH DE number 3465211 (Why is no real title available?)
- scientific article; zbMATH DE number 3555910 (Why is no real title available?)
- scientific article; zbMATH DE number 3319969 (Why is no real title available?)
- Berechnung und Programm. I
- Berechnungen in partiellen Algebren endlichen Typs
- Complexity of monotone networks for Boolean matrix product
- Fast multiplication of large numbers
- Gaussian elimination is not optimal
- Monotone switching circuits and Boolean matrix product
- On the computational power of pushdown automata
Cited in
(8)- \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice
- The direct sum of universal relations
- The communication complexity of enumeration, elimination, and selection
- On the complexity of 2-output Boolean networks
- Geometric arguments yield better bounds for threshold circuits and distributed computing
- Characterization of all optimal networks for a simultaneous computation of AND and NOR
- Minimal polynomials for the conjunction of functions on disjoint variables can be very simple
- The choice and agreement problems of a random function
This page was built for publication: Realizing Boolean functions on disjoint sets of variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1233425)
