Limiting negations in non-deterministic circuits
type: Item
instance of: scholarly article
title: Limiting negations in non-deterministic circuits
zbMATH Open document ID: 1170.94347
author: Hiroki Morizumi
published in: Theoretical Computer Science
publication date: 2009-09-10T00:00:00Z
Mathematics Subject Classification ID: 94C05
zbMATH DE Number: 5602756
zbMATH Keywords: circuit complexity
zbMATH Keywords: negation-limited circuit
zbMATH Keywords: non-deterministic circuit
zbMATH Keywords: inversion complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.05.018
OpenAlex ID: W2077017336
cites work: The monotone circuit complexity of Boolean functions
cites work: A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates
cites work: On the negation-limited circuit complexity of merging
cites work: Q4726174
cites work: On the Complexity of Negation-Limited Boolean Networks
cites work: Q4092993
cites work: On the minimum number of negations leading to super-polynomial savings
cites work: Characterizing non-deterministic circuit size
cites work: On the Inversion Complexity of a System of Functions
cites work: Negation-Limited Inverters of Linear Size
cites work: Q3758729
cites work: Limiting Negations in Constant Depth Circuits
cites work: An exponential gap with the removal of one negation gate
cites work: Algorithms and Computation
cites work: Q3762226
DOI: 10.1016/J.TCS.2009.05.018
description: scientific article; zbMATH DE number 5602756