Search Results - "monotone boolean function complexity"

Replaceability and computational equivalence for monotone boolean functions

Authors: Meurig Beynon

Source: Acta Informatica. 22:433-449

Subject Terms: replaceability, abstract simplicial complex, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, Structure and representation theory of distributive lattices, 0202 electrical engineering, electronic engineering, information engineering, monotone boolean networks, 0102 computer and information sciences, 02 engineering and technology, monotone boolean function complexity, computational equivalence, 01 natural sciences, finite distributive lattices

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/acta/acta22.html#Beynon85
https://link.springer.com/article/10.1007%2FBF00288777