Negation-Limited Complexity of Parity and Inverters

DOI10.1007/11940128_24zbMath1135.68429OpenAlexW1588568034MaRDI QIDQ5459118

Jun Tarui, Hiroki Morizumi, Kazuo Iwama

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_24

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Reductions for monotone Boolean circuits ⋮ Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences

This page was built for publication: Negation-Limited Complexity of Parity and Inverters