scientific article; zbMATH DE number 5827847

zbMATH Open1201.06009MaRDI QIDQ3063985FDOQ3063985

Authors: O. M. Kasim-Zade 

Publication date: 18 December 2010

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

Recommendations

• One approach to synthesizing predicate circuits on the basis of generalized variables
• Asymptotic behavior of the Shannon function for a class of circuits of functional elements.
• Realization of functions in \(P_k\) by circuits of functional elements over an arbitrary basis
• The best asymptotic representation of Boolean functions by information graphs
• Complexity of monotonic functions
• scientific article; zbMATH DE number 3257823
• General upper bound of circuit complexity in an arbitrary infinite complete base
• On the synthesis and complexity of formulae with bounded depth of alternation
• scientific article; zbMATH DE number 3896833
• Complexity of approximate realization of functions, satisfying the Lipschitz condition, by schemes in continuous bases

Mathematics Subject Classification ID

Boolean functions (06E30)

Cited In (7)

• On the parity complexity measures of Boolean functions
• The best asymptotic representation of Boolean functions by information graphs
• Book review of: S. Jukna, Boolean function complexity. Advances and frontiers.
• On a metric characteristic of implicit and parametric representations of Boolean functions
• Implicitly maximal classes and implicit completeness criterion in the three-valued logic
• Behavior of Shannon functions for complexity of parametric representations of Boolean functions
• Parametric representation of Boolean functions over a quasifield of \(8\)th order

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