On the planar monotone computation of Boolean functions

DOI10.1016/0304-3975(87)90068-5zbMath0637.94023OpenAlexW2056316465MaRDI QIDQ1099134

Meurig Beynon, John Buckle

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90068-5

zbMATH Keywords

monotone Boolean functionprime implicantsclausesplanar monotone circuitplanar monotone computable

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Replaceability and computational equivalence for monotone boolean functions
• Unnamed Item
• Unnamed Item

This page was built for publication: On the planar monotone computation of Boolean functions