scientific article; zbMATH DE number 176507

zbMATH Open0764.94025MaRDI QIDQ4035672FDOQ4035672

Authors:

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Limiting Negations in Constant Depth Circuits
• On the Complexity of Negation-Limited Boolean Networks
• Algorithms and Computation
• Limiting negations in bounded-depth circuits: an extension of Markov's theorem
• Negation-limited circuit complexity of symmetric functions

zbMATH Keywords

Boolean functioncircuitthreshold circuitsfan-in circuits

Mathematics Subject Classification ID

Cited In (13)

• Limiting Negations in Constant Depth Circuits
• Non-cancellative Boolean circuits: a generalization of monotone Boolean circuits
• On the minimum number of negations leading to super-polynomial savings
• Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
• Negation-limited formulas
• Title not available (Why is that?)
• On the positive and the inversion complexity of Boolean functions
• Algorithms and Computation
• Limiting negations in bounded-depth circuits: an extension of Markov's theorem
• Lower bounds for Boolean circuits of bounded negation width
• Lower bounds for constant-depth circuits in the presence of help bits
• Linear-size constant-depth polylog-threshold circuits
• Limiting negations in bounded treewidth and upward planar circuits

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035672)