AbstractThe complexity of 2-output combinational networks without feedback is explored. For monotone networks, which contain only and-gates and or-gates, if the two outputs can be expressed as Boolean functions having at most one variable in common, then the network obtained by adjoining optimal realizations of the individual functions is optimal. This property fails if the number of common input variables is greater than one or when not-gates are allowed
AbstractLet fn:{0, 1}2⌜lgn⌝+1+n→{0, 1} be the Boolean function fn(a,b,q,z1…,zn)=q⋁j=1n zj(a=j∨b=j)∨ ...
International audienceWe prove that the fully asynchronous dynamics of a Boolean network f : {0, 1}^...
We prove a lower bound of 4.5n - o(n) for the circuit complexity of an explicit Boolean function (th...
AbstractThe complexity of 2-output combinational networks without feedback is explored. For monotone...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
In this paper, we consider the size of combinational switching networks required to synthesize monot...
In this paper we study the complexity of realizing a monotone but otherwise arbitrary Boolean functi...
AbstractAny computation of Boolean matrix product by an acyclic network using only the operations of...
Summary Neciporuk, Lamagna/Savage and Tarjan determined the monotone network complexity of a set of...
In his paper “On a Boolean matrix”, Nechiporuk gave an explicit example of a set of n homogeneous mo...
AbstractThe multiplicative complexity c∧(f) of a Boolean function f is the minimum number of AND gat...
Any computation of Boolean matrix product by an acyclic network using only the operations of binary...
AbstractIn his paper “On a Boolean matrix”, Nechiporuk gave an explicit example of a set of n homoge...
Summary. Neciporuk, Lamagna/Savage and Tarjan determined the mo-notone network complexity of a set o...
This paper considers a particular relationship defined overpairs of n-argument monotone Boolean func...
AbstractLet fn:{0, 1}2⌜lgn⌝+1+n→{0, 1} be the Boolean function fn(a,b,q,z1…,zn)=q⋁j=1n zj(a=j∨b=j)∨ ...
International audienceWe prove that the fully asynchronous dynamics of a Boolean network f : {0, 1}^...
We prove a lower bound of 4.5n - o(n) for the circuit complexity of an explicit Boolean function (th...
AbstractThe complexity of 2-output combinational networks without feedback is explored. For monotone...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
In this paper, we consider the size of combinational switching networks required to synthesize monot...
In this paper we study the complexity of realizing a monotone but otherwise arbitrary Boolean functi...
AbstractAny computation of Boolean matrix product by an acyclic network using only the operations of...
Summary Neciporuk, Lamagna/Savage and Tarjan determined the monotone network complexity of a set of...
In his paper “On a Boolean matrix”, Nechiporuk gave an explicit example of a set of n homogeneous mo...
AbstractThe multiplicative complexity c∧(f) of a Boolean function f is the minimum number of AND gat...
Any computation of Boolean matrix product by an acyclic network using only the operations of binary...
AbstractIn his paper “On a Boolean matrix”, Nechiporuk gave an explicit example of a set of n homoge...
Summary. Neciporuk, Lamagna/Savage and Tarjan determined the mo-notone network complexity of a set o...
This paper considers a particular relationship defined overpairs of n-argument monotone Boolean func...
AbstractLet fn:{0, 1}2⌜lgn⌝+1+n→{0, 1} be the Boolean function fn(a,b,q,z1…,zn)=q⋁j=1n zj(a=j∨b=j)∨ ...
International audienceWe prove that the fully asynchronous dynamics of a Boolean network f : {0, 1}^...
We prove a lower bound of 4.5n - o(n) for the circuit complexity of an explicit Boolean function (th...
DOI
Add to ORKG