On the negation-limited circuit complexity of merging
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
On the minimum number of negations leading to super-polynomial savings
Information Processing Letters
On the negation-limited circuit complexity of merging
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Hi-index | 0.00 |