AbstractA sequence of monotone switching functions hn:{0,1}n→ {0,1}n is constructed, such that the monotone complexity of hn grows faster than Ω(n2 log−2n). Previously the best lower bounds of this nature were several Ω(n32 bounds due to Pratt, Paterson, Mehlhorn and Galil and Savage
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the i...
A {+,×}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same a...
Abstract—An approximate computation of a Boolean func-tion by a circuit or switching network is a co...
AbstractWe construct a sequence of monotone Boolean functions hn :{0, 1}n→{0, 1}n, such that the mon...
AbstractSchnorr[1] proved a lower bound on the number of additions in monotone computations of ratio...
AbstractWe construct a sequence of monotone Boolean functions hn :{0, 1}n→{0, 1}n, such that the mon...
Our main result is a combinatorial lower bounds criterion for a general model of monotone circuits, ...
In this paper, we consider the size of combinational switching networks required to synthesize monot...
AbstractWe prove an Ω(n43) lower bound on the number of Λ-gates in any monotone network computing th...
An approximate computation of a function f: {0, 1}n → {0, 1} by a circuit or switching network M is ...
Using a notion of real communication complexity recently introduced by J. Krajcek, we prove a lower ...
AbstractFor switching functions f let C(f) be the combinational complexity of f. We prove that for e...
AbstractThe minimal number, of conjuctions in monotone circuits for quadratic Boolean functions, i.e...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
We introduce the notion of monotone linear-programming circuits (MLP circuits), a model of computat...
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the i...
A {+,×}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same a...
Abstract—An approximate computation of a Boolean func-tion by a circuit or switching network is a co...
AbstractWe construct a sequence of monotone Boolean functions hn :{0, 1}n→{0, 1}n, such that the mon...
AbstractSchnorr[1] proved a lower bound on the number of additions in monotone computations of ratio...
AbstractWe construct a sequence of monotone Boolean functions hn :{0, 1}n→{0, 1}n, such that the mon...
Our main result is a combinatorial lower bounds criterion for a general model of monotone circuits, ...
In this paper, we consider the size of combinational switching networks required to synthesize monot...
AbstractWe prove an Ω(n43) lower bound on the number of Λ-gates in any monotone network computing th...
An approximate computation of a function f: {0, 1}n → {0, 1} by a circuit or switching network M is ...
Using a notion of real communication complexity recently introduced by J. Krajcek, we prove a lower ...
AbstractFor switching functions f let C(f) be the combinational complexity of f. We prove that for e...
AbstractThe minimal number, of conjuctions in monotone circuits for quadratic Boolean functions, i.e...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
We introduce the notion of monotone linear-programming circuits (MLP circuits), a model of computat...
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the i...
A {+,×}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same a...
Abstract—An approximate computation of a Boolean func-tion by a circuit or switching network is a co...
DOI
Add to ORKG