Negation is Powerless for Boolean Slice Functions

DOI10.1137/0215037MaRDI QIDQ4726175zbMATH OpenOpenAlexFDO

Authors Leslie G. Valiant

Publication date 1986

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0215037

zbMATH Keywords

Boolean functioncircuit complexitycomplexity of minimal size Boolean circuitsmonotone circuitslice functionupper bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of slice functions
• More on the complexity of slice functions
• On monotone simulations on nonmonotone networks
• scientific article; zbMATH DE number 3889430
• The complexity of central slice functions

Cited in

(13)

• On the minimum number of negations leading to super-polynomial savings
• On the complexity of slice functions
• More on the complexity of slice functions
• The complexity of central slice functions
• On monotone simulations on nonmonotone networks
• \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice
• On \(\epsilon\)-sensitive monotone computations
• Fast monotone summation over disjoint sets
• Fast Möbius inversion in semimodular lattices and ER-labelable posets
• scientific article; zbMATH DE number 3889430 (Why is no real title available?)
• On Negations in Boolean Networks
• On derandomization and average-case complexity of monotone functions
• Reductions for Monotone Boolean Circuits

This page was built for publication: Negation is Powerless for Boolean Slice Functions

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