An exponential gap with the removal of one negation gate
type: Item
instance of: scholarly article
title: An exponential gap with the removal of one negation gate
zbMATH Open document ID: 1015.68519
DOI: 10.1016/S0020-0190(01)00264-2
author: Keisuke Tanaka
author: S-C. Sung
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1767467
zbMATH Keywords: computational complexity
zbMATH Keywords: circuit complexity
zbMATH Keywords: negation-limited circuits
MaRDI profile type: Publication
cites work: Q3758729
cites work: The monotone circuit complexity of Boolean functions
cites work: Monotone circuits for matching require linear depth
cites work: The gap between monotone and non-monotone circuit complexity is exponential
cites work: On the Inversion Complexity of a System of Functions
cites work: Q4092993
cites work: Q4234108
cites work: On the Shannon capacity of a graph
cites work: Negation-limited circuit complexity of symmetric functions
full work available at URL: s0020-0190(01)00264-2
OpenAlex ID: W2053969720
description: scientific article; zbMATH DE number 1767467