scientific article; zbMATH DE number 3906395

MaRDI QIDQ3684036zbMATH OpenFDO

Authors William F. McColl

Publication date 1985

zbMATH Keywords

complexitymonotone symmetric Boolean function of n argumentsplanar monotone circuits

Mathematics Subject Classification ID

Recommendations

• On the planar monotone computation of Boolean functions
• On the complexity of monotone circuits for threshold symmetric Boolean functions
• scientific article; zbMATH DE number 4172377
• scientific article; zbMATH DE number 4217938
• Efficient monotone circuits for threshold functions

Cited in

(18)

• Threshold functions and bounded depth monotone circuits
• On the planar monotone computation of Boolean functions
• Functions computed by monotone Boolean formulas with no repeated variables
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• Lower bounds on the area complexity of Boolean circuits
• Directed monotone contact networks for threshold functions
• On the complexity of planar Boolean circuits
• Freezing sandpiles and Boolean threshold networks: equivalence and complexity
• On the complexity of monotone circuits for threshold symmetric Boolean functions
• scientific article; zbMATH DE number 4172377 (Why is no real title available?)
• scientific article; zbMATH DE number 4217938 (Why is no real title available?)
• scientific article; zbMATH DE number 3906394 (Why is no real title available?)
• scientific article; zbMATH DE number 609922 (Why is no real title available?)
• scientific article; zbMATH DE number 1129493 (Why is no real title available?)
• Threshold circuits for global patterns in 2-dimensional maps
• Planar acyclic computation
• A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\)
• Comment on Kochol's paper ``Efficient monotone circuits for threshold functions

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 Q3684036)