scientific article

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Boolean functions monotone network complexity Boolean network complexity combinational network complexity planar network complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Discrete mathematics in relation to computer science (68R99)

Related Items (28)

Multiprocessor simulation strategies with optimal speed-up ⋮ Complexity of Boolean functions over bases with unbounded fan-in gates ⋮ Complexity of computation in finite fields ⋮ How Do Read-Once Formulae Shrink? ⋮ Comment on Kochol's paper ``Efficient monotone circuits for threshold functions ⋮ The complexity of deciding reachability properties of distributed negotiation schemes ⋮ Tight bounds for the multiplicative complexity of symmetric functions ⋮ Comparison between parallel and serial dynamics of Boolean networks ⋮ Upper bounds for the formula size of symmetric Boolean functions ⋮ Maximum number of fixed points in AND-OR-NOT networks ⋮ On the computational complexity of coalitional resource games ⋮ The complexity of contract negotiation ⋮ On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). ⋮ On a small class of Boolean sums ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ FINDING CYCLES IN SYNCHRONOUS BOOLEAN NETWORKS WITH APPLICATIONS TO BIOCHEMICAL SYSTEMS ⋮ Sequential operator for filtering cycles in Boolean networks ⋮ Shrinkage of de Morgan formulae under restriction ⋮ SIMPLIFYING BOOLEAN NETWORKS ⋮ Planar acyclic computation ⋮ On the complexity of monotone circuits for threshold symmetric Boolean functions ⋮ On Negations in Boolean Networks ⋮ Computational properties of argument systems satisfying graph-theoretic constraints ⋮ On the number of ANDs versus the number of ORs in monotone Boolean circuits ⋮ Coherence in finite argument systems. ⋮ Topics in the theory of DNA computing. ⋮ Shallow circuits and concise formulae for multiple addition and multiplication ⋮ On the computational complexity of qualitative coalitional games

This page was built for publication: