290 search results - page 46 / 58 » Lattice-based computation of Boolean functions |
ICCD
1991
IEEE
13 years 11 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
JSW
2008
13 years 7 months ago
2008
Extensible Markup Language (XML) is a powerful tool used for describing structured documents and exchanging standardized data files over the Internet. This article describes how us...
ET
2007
13 years 7 months ago
2007
Crossbar architectures are one approach to molecular electronic circuits for memory and logic applications. However, currently feasible manufacturing technologies introduce numero...
MST
2010
13 years 6 months ago
2010
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
JCSS
2008
13 years 7 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...