scientific article; zbMATH DE number 3906395

zbMATH Open0567.94016MaRDI QIDQ3684036FDOQ3684036

Authors: William F. McColl 

Publication date: 1985

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

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
• Efficient monotone circuits for threshold functions

zbMATH Keywords

complexitymonotone symmetric Boolean function of n argumentsplanar monotone circuits

Mathematics Subject Classification ID

Cited In (15)

• Threshold functions and bounded depth monotone circuits
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• Lower bounds on the area complexity of Boolean circuits
• Title not available (Why is that?)
• Freezing sandpiles and Boolean threshold networks: equivalence and complexity
• Planar acyclic computation
• Directed monotone contact networks for threshold functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of planar Boolean circuits
• Comment on Kochol's paper ``Efficient monotone circuits for threshold functions
• A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\)
• Title not available (Why is that?)
• On the planar monotone computation of Boolean functions
• Functions computed by monotone Boolean formulas with no repeated variables

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)