On the planar monotone computation of Boolean functions
From MaRDI portal
Publication:1099134
Recommendations
Cites work
Cited in
(14)- On the complexity of planar Boolean circuits
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Succinct certification of monotone circuits
- Computing with planar toppling domino arrangements
- Order of power of planar circuits implementing Boolean functions
- Computing with planar toppling domino arrangements
- scientific article; zbMATH DE number 4172377 (Why is no real title available?)
- On Planar Boolean CSP
- scientific article; zbMATH DE number 3906395 (Why is no real title available?)
- scientific article; zbMATH DE number 1129493 (Why is no real title available?)
- An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits
- Evaluating Monotone Circuits on Cylinders, Planes and Tori
- Planar acyclic computation
- Replaceability and computational equivalence for monotone boolean functions
This page was built for publication: On the planar monotone computation of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099134)