983 search results - page 5 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
COCO
1991
Springer
15 years 4 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
135
click to vote
ISAAC
1993
Springer
15 years 5 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
MST
2007
15 years 20 days ago
2007
DSD
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper considers a single-digit error detection in a Redundant Residue Number System (RRNS). Let f be the function that denotes the set of legitimate codes of an RRNS. To anal...