scientific article; zbMATH DE number 1261805

MaRDI QIDQ4231908zbMATH OpenFDO

Authors Armin Haken

Publication date 31 August 1999

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(6)

• On Negations in Boolean Networks
• An exponential lower bound for the size of monotone real circuits
• Monotone circuit lower bounds from resolution
• On the bottleneck counting argument
• Monotone real circuits are more powerful than monotone Boolean circuits
• Tight bounds for monotone switching networks via Fourier analysis

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