scientific article; zbMATH DE number 176866

MaRDI QIDQ4036697zbMATH OpenFDO

Authors Paul E. Dunne

Publication date 18 May 1993

zbMATH Keywords

lower boundsBoolean networksnetwork complexitycombinational networksBoolean function complexitymonotone networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

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

Cited in

(6)

• Nearly optimal hierarchies for network and formula size
• An n3/2 lower bound on the monotone network complexity of the Boolean convolution
• Lower bounds for Boolean circuits of bounded negation width
• scientific article; zbMATH DE number 1418485 (Why is no real title available?)
• Non-monotonicity of the generalized dimensions of a complex network
• On Negations in Boolean Networks

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)