Replaceability and computational equivalence for monotone boolean functions

DOI10.1007/BF00288777zbMath0545.94022MaRDI QIDQ798296

Meurig Beynon

Publication date: 1985

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

finite distributive latticesabstract simplicial complexcomputational equivalencemonotone boolean function complexitymonotone boolean networksreplaceability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structure and representation theory of distributive lattices (06D05)

Related Items (1)

On the planar monotone computation of Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of monotone networks for Boolean matrix product
• Monotone switching circuits and Boolean matrix product
• Relating monotone formula size and monotone depth of Boolean functions
• Duality Theorems for Finitely Generated Vector Lattices
• Vector lattices freely generated by distributive lattices

This page was built for publication: Replaceability and computational equivalence for monotone boolean functions