scientific article; zbMATH DE number 4193610

MaRDI QIDQ5202146zbMATH OpenFDO

Authors Alexander Razborov

Publication date 1990

zbMATH Keywords

monotone Boolean functionsmonotone complexityTuring complexity

Mathematics Subject Classification ID

Boolean functions (06E30)

Cited in

(11)

• Exact lower time bounds for computing Boolean functions on CREW PRAMs
• Bounds for the average-case complexity of monotone Boolean functions
• Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
• Lower bounds for monotone counting circuits
• A lower bound for the affinity level for almost all Boolean functions
• Amplification of Bounded Depth Monotone Read-Once Boolean Formulae
• scientific article; zbMATH DE number 3867233 (Why is no real title available?)
• scientific article; zbMATH DE number 4217938 (Why is no real title available?)
• scientific article; zbMATH DE number 4095386 (Why is no real title available?)
• scientific article; zbMATH DE number 609922 (Why is no real title available?)
• Reductions for monotone Boolean circuits

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