Chair of Discrete Mathematics
From MaRDI portal
Cites work
- A circuit of depth two with limited input branching for majority functions
- An asymptotic lower bound on the number of bent functions
- Asymptotics for the complexity of Boolean functions with small number of ones
- Classes of functions of k-valued logics monotone with respect to the sets of width two
- Complexity and structure of circuits for parity functions
- scientific article; zbMATH DE number 1166265 (Why is no real title available?)
- scientific article; zbMATH DE number 850399 (Why is no real title available?)
- scientific article; zbMATH DE number 3205680 (Why is no real title available?)
- scientific article; zbMATH DE number 3285248 (Why is no real title available?)
- Implicitly maximal classes and implicit completeness criterion in the three-valued logic
- On the classes of autodual functions implicitly maximal in \(P_k \)
- On the complexity of implementation of a system of two monomials by composition circuits
- On the complexity of realization of Boolean functions by formulas
- ON THE NUMBER OF TRIANGULATION SIMPLEXES
- On the papers of O. M. Kasim-Zade in field of complexity theory and theory of multivalued logics
- Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing
This page was built for publication: Chair of Discrete Mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972216)
