On the negation-limited circuit complexity of merging
type: Item
instance of: scholarly article
title: On the negation-limited circuit complexity of merging
zbMATH Open document ID: 1011.68040
DOI: 10.1016/S0166-218X(02)00215-9
author: Kazuyuki Amano
author: A. Maruoka
author: Jun Tarui
published in: Discrete Applied Mathematics
publication date: 2003-03-09T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 1878525
zbMATH Keywords: negation-limited circuits
MaRDI profile type: Publication
cites work: Sorting in \(c \log n\) parallel steps
cites work: The monotone circuit complexity of Boolean functions
cites work: Q4218113
cites work: Q4726174
cites work: On the Complexity of Negation-Limited Boolean Networks
cites work: Q4385519
cites work: Q4092993
cites work: Q4369384
cites work: On the Inversion Complexity of a System of Functions
cites work: The gap between monotone and non-monotone circuit complexity is exponential
description: scientific article; zbMATH DE number 1878525