Add to ORKGSIGLEAvailable from British Library Lending Division - LD:8814.6307(67) / BLDSC - British Library Document Supply CentreGBUnited Kingdo
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the i...
We prove various results on monotone Boolean functions. In particular, we prove a conjecture propose...
SIGLEAvailable from British Library Document Supply Centre- DSC:D061393 / BLDSC - British Library Do...
Available from British Library Document Supply Centre- DSC:7769.09285(WU-DCS--RR--109) / BLDSC - Bri...
AbstractA criterion for testing whether a given monotone boolean function f is planar monotone compu...
SIGLEAvailable from British Library Lending Division - LD:D56589/85 / BLDSC - British Library Docume...
SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(DAMTP-NA--10/1989) / BLDSC...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
We examine various structural properties of idempotent monotone Boolean functions. The free distribu...
In this paper we study the complexity of realizing a monotone but otherwise arbitrary Boolean functi...
A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in the plane and that cont...
The negation width of a Boolean AND, OR, NOT circuit computing a monotone Boolean function f is the ...
SIGLEAvailable from British Library Document Supply Centre- DSC:3511.638(DAI-RP--355) / BLDSC - Brit...
D. M. Barrington proved the coincidence of the class NC1 of functions computable by the circuits of ...
. A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in the plane and that co...
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the i...
We prove various results on monotone Boolean functions. In particular, we prove a conjecture propose...
SIGLEAvailable from British Library Document Supply Centre- DSC:D061393 / BLDSC - British Library Do...
Available from British Library Document Supply Centre- DSC:7769.09285(WU-DCS--RR--109) / BLDSC - Bri...
AbstractA criterion for testing whether a given monotone boolean function f is planar monotone compu...
SIGLEAvailable from British Library Lending Division - LD:D56589/85 / BLDSC - British Library Docume...
SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(DAMTP-NA--10/1989) / BLDSC...
We study the realization of monotone Boolean functions by networks. Our main result is a precise ver...
We examine various structural properties of idempotent monotone Boolean functions. The free distribu...
In this paper we study the complexity of realizing a monotone but otherwise arbitrary Boolean functi...
A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in the plane and that cont...
The negation width of a Boolean AND, OR, NOT circuit computing a monotone Boolean function f is the ...
SIGLEAvailable from British Library Document Supply Centre- DSC:3511.638(DAI-RP--355) / BLDSC - Brit...
D. M. Barrington proved the coincidence of the class NC1 of functions computable by the circuits of ...
. A planar monotone circuit (PMC) is a Boolean circuit that can be embedded in the plane and that co...
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the i...
We prove various results on monotone Boolean functions. In particular, we prove a conjecture propose...
SIGLEAvailable from British Library Document Supply Centre- DSC:D061393 / BLDSC - British Library Do...