A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
On the Negation-Limited Circuit Complexity of Merging
[chapter]
1999
Lecture Notes in Computer Science
A negation-limited circuit is a combinational circuit that consists of AND, OR gates and a limited number of NOT gates. In this paper, we investigate the complexity of negation-limited circuits. The (n; n) merging function is a function that merges two presorted binary sequences x1 6 · · · 6 xn and y1 6 · · · 6 yn into a sequence z1 6 · · · 6 z2n. We prove that the size complexity of the (n; n) merging function with t = (log 2 log 2 n − a) NOT gates is (2 a n). ?
doi:10.1007/3-540-48686-0_20
fatcat:ub6elrmuofac7k4vu32d7r2x2u