In this paper, a general lower bound on the monotone network complexity of semidisjoint bilinear forms is proved. By this method an n3/2 lower bound for the Boolean convolution is obtained. Up to now the best known lower bound for the Boolean convolution was of size n4/3 (Blum 1981, IEEE Annual Sympos. Found. Comput. Sci. 22, 101–108)
In this paper we study the complexity of realizing a monotone but otherwise arbitrary Boolean functi...
Abstract: We prove tight size bounds on monotone switching networks for the NP-complete problem of k...
AbstractAny computation of Boolean matrix product by an acyclic network using only the operations of...
We study the monotone circuit complexity of the so called semi-disjoint bilinear forms over the Bool...
In this paper, we consider the size of combinational switching networks required to synthesize monot...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
AbstractWe prove an Ω(n43) lower bound on the number of Λ-gates in any monotone network computing th...
AbstractWe construct a sequence of monotone Boolean functions hn :{0, 1}n→{0, 1}n, such that the mon...
Abstract—An approximate computation of a Boolean func-tion by a circuit or switching network is a co...
AbstractPaul (1977) has proved a 2.5n-lower bound for the network complexity of an explicit Boolean ...
Summary Neciporuk, Lamagna/Savage and Tarjan determined the monotone network complexity of a set of...
Razborov introduced an elegant rank-based complexity measure for proving lower bounds on the monoton...
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the i...
Is it easier to solve two communication problems together than separately? This question is related ...
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)∨ ...
In this paper we study the complexity of realizing a monotone but otherwise arbitrary Boolean functi...
Abstract: We prove tight size bounds on monotone switching networks for the NP-complete problem of k...
AbstractAny computation of Boolean matrix product by an acyclic network using only the operations of...
We study the monotone circuit complexity of the so called semi-disjoint bilinear forms over the Bool...
In this paper, we consider the size of combinational switching networks required to synthesize monot...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
AbstractWe prove an Ω(n43) lower bound on the number of Λ-gates in any monotone network computing th...
AbstractWe construct a sequence of monotone Boolean functions hn :{0, 1}n→{0, 1}n, such that the mon...
Abstract—An approximate computation of a Boolean func-tion by a circuit or switching network is a co...
AbstractPaul (1977) has proved a 2.5n-lower bound for the network complexity of an explicit Boolean ...
Summary Neciporuk, Lamagna/Savage and Tarjan determined the monotone network complexity of a set of...
Razborov introduced an elegant rank-based complexity measure for proving lower bounds on the monoton...
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the i...
Is it easier to solve two communication problems together than separately? This question is related ...
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)∨ ...
In this paper we study the complexity of realizing a monotone but otherwise arbitrary Boolean functi...
Abstract: We prove tight size bounds on monotone switching networks for the NP-complete problem of k...
AbstractAny computation of Boolean matrix product by an acyclic network using only the operations of...
DOI
Add to ORKG