983 search results - page 36 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
ICCD
2004
IEEE
14 years 4 months ago
2004
IEEE
This paper proposes a new formalism for layout-driven optimization of datapaths. It is based on preserving an arithmetic bit level representation of the arithmetic circuit portion...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
RECOMB
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Clusters of genes that have evolved by repeated segmental duplication present difficult challenges throughout genomic analysis, from sequence assembly to functional analy...
ISMVL
1999
IEEE
14 years 18 hour ago
1999
IEEE
We introduce a new implementation of a ternary adder with four inputs and two outputs. This ternary adder reduces the number of digits in a multiplication compared with a binary m...
CPC
2004
13 years 7 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...