scientific article; zbMATH DE number 176866

zbMATH Open0766.68059MaRDI QIDQ4036697FDOQ4036697

Authors: Paul E. Dunne 

Publication date: 18 May 1993

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

Recommendations

• scientific article; zbMATH DE number 3867233
• scientific article; zbMATH DE number 42045
• Publication:4942047
• scientific article; zbMATH DE number 4095386
• On Negations in Boolean Networks

zbMATH Keywords

lower boundsBoolean networksnetwork complexitycombinational networksBoolean function complexitymonotone networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (6)

• An n3/2 lower bound on the monotone network complexity of the Boolean convolution
• On Negations in Boolean Networks
• Lower bounds for Boolean circuits of bounded negation width
• Non-monotonicity of the generalized dimensions of a complex network
• Nearly optimal hierarchies for network and formula size
• Title not available (Why is that?)

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