scientific article; zbMATH DE number 3926815

MaRDI QIDQ3701344zbMATH OpenFDO

Authors Elizaveta Antonovna Okol'Nishnikova

Publication date 1984

zbMATH Keywords

Boolean function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• On algorithm complexity
• A method for obtaining efficient lower bounds for monotone complexity

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