Paul [P] first proved a 2.5n-lower bound for the network complexity of an explicit boolean function. We modify the definition of Paul's function a little and prove a 3n-lower bound for the network complexity of that function
We consider boolean circuits in which every gate may compute an arbitrary boolean function of k othe...
We prove a lower bound of 4.5n - o(n) for the circuit complexity of an explicit Boolean function (th...
Abstract. We prove a lower bound of 5n − o(n) for the circuit complexity of an explicit (constructib...
AbstractPaul (1977) has proved a 2.5n-lower bound for the network complexity of an explicit Boolean ...
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)∨ ...
AbstractWe prove an Ω(n43) lower bound on the number of Λ-gates in any monotone network computing th...
AbstractIn this paper we investigate the combinational complexity of Boolean functions satisfying a ...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
Although a simple counting argument shows the existence of Boolean functions of exponential circuit ...
AbstractTwo fundamental complexity measures for a Boolean function f are its circuit depth d(f) and ...
In this paper we review the known bounds for L(n), the circuit size complexity of the hardest Boole...
AbstractA method for obtaining lower bounds on the contact circuit complexity of explicitly defined ...
AbstractWe study the bit-complexity of computing Boolean functions on anonymous networks. Let N be t...
AbstractThe complexity of 2-output combinational networks without feedback is explored. For monotone...
AbstractConsider the Boolean functions and(n)=⋀i=1n xi nor(n)=⋀i=1n ¬ xi and the equivalence Eq(n)=a...
We consider boolean circuits in which every gate may compute an arbitrary boolean function of k othe...
We prove a lower bound of 4.5n - o(n) for the circuit complexity of an explicit Boolean function (th...
Abstract. We prove a lower bound of 5n − o(n) for the circuit complexity of an explicit (constructib...
AbstractPaul (1977) has proved a 2.5n-lower bound for the network complexity of an explicit Boolean ...
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)∨ ...
AbstractWe prove an Ω(n43) lower bound on the number of Λ-gates in any monotone network computing th...
AbstractIn this paper we investigate the combinational complexity of Boolean functions satisfying a ...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
Although a simple counting argument shows the existence of Boolean functions of exponential circuit ...
AbstractTwo fundamental complexity measures for a Boolean function f are its circuit depth d(f) and ...
In this paper we review the known bounds for L(n), the circuit size complexity of the hardest Boole...
AbstractA method for obtaining lower bounds on the contact circuit complexity of explicitly defined ...
AbstractWe study the bit-complexity of computing Boolean functions on anonymous networks. Let N be t...
AbstractThe complexity of 2-output combinational networks without feedback is explored. For monotone...
AbstractConsider the Boolean functions and(n)=⋀i=1n xi nor(n)=⋀i=1n ¬ xi and the equivalence Eq(n)=a...
We consider boolean circuits in which every gate may compute an arbitrary boolean function of k othe...
We prove a lower bound of 4.5n - o(n) for the circuit complexity of an explicit Boolean function (th...
Abstract. We prove a lower bound of 5n − o(n) for the circuit complexity of an explicit (constructib...
DOI
Add to ORKG