Searching for "On the negation-limited circuit complexity of merging." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

On the Negation-Limited Circuit Complexity of Merging
by Kazuyuki Amano, Akira Maruoka, Jun Tarui — 1999 — Proc. 5th COCOON, Lecture Notes in Computer Sciences
…On the Negation-Limited Circuit Complexity of Merging Kazuyuki Amano 1 , Akira Maruoka 1…
Cited by 2 (1 self) – Add To MetaCart

unknown title
by unknown authors — 2001
… on negation-limited circuit complexity. The merging function is a Boolean function that takes two presorted…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB