44 search results - page 5 / 9 » Boolean Functions, Invariance Groups and Parallel Complexity |
STOC
1989
ACM
15 years 3 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...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
Locally and functionally distributed applications realized on different system architectures demand a universal, portable and intuitive software utility for interprocess communica...
101
click to vote
VLSISP
2008
14 years 11 months ago
2008
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
ISPAN
1999
IEEE
15 years 4 months ago
1999
IEEE
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...