Replaceability and computational equivalence for monotone boolean functions
From MaRDI portal
(Redirected from Publication:798296)
Recommendations
- The monotone circuit complexity of Boolean functions
- scientific article; zbMATH DE number 4204284
- The reduction of general Boolean functions to monotonic form
- On the planar monotone computation of Boolean functions
- Functions computed by monotone Boolean formulas with no repeated variables
- scientific article; zbMATH DE number 3884098
- Representations of monotone Boolean functions by linear programs
- Representations of monotone Boolean functions by linear programs
- Approximation of Boolean functions by monomial ones
Cites work
- scientific article; zbMATH DE number 3884098 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3366941 (Why is no real title available?)
- Complexity of monotone networks for Boolean matrix product
- Duality Theorems for Finitely Generated Vector Lattices
- Monotone switching circuits and Boolean matrix product
- Relating monotone formula size and monotone depth of Boolean functions
- Vector lattices freely generated by distributive lattices
Cited in
(2)
This page was built for publication: Replaceability and computational equivalence for monotone boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798296)
