12 search results - page 1 / 3 » Extensional Uniformity for Boolean Circuits |
CSL
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
SIAMCOMP
2010
13 years 2 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
NC
2011
12 years 11 months ago
2011
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
STOC
1996
ACM
13 years 8 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
STOC
1989
ACM
13 years 8 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...