scientific article; zbMATH DE number 3133387

zbMATH Open0081.20902MaRDI QIDQ3249579FDOQ3249579

Authors: O. B. Lupanov 

Publication date: 1958

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

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cited In (30)

• The complexity of depth-3 circuits computing symmetric Boolean functions
• Characteristic measures of switching functions
• Mining circuit lower bound proofs for meta-algorithms
• A class of Boolean functions with linear combinational complexity
• On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs
• Asymptotical behaviour of some non-uniform measures
• On algorithm complexity
• Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
• Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
• The contact process with switching
• On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts
• Almost everywhere high nonuniform complexity
• Scaled dimension and nonuniform complexity
• Circuit size relative to pseudorandom oracles
• Orders of growth of Shannon functions for circuit complexity over infinite bases
• Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
• Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
• One-way permutations, computational asymmetry and distortion.
• Lower bounds against weakly-uniform threshold circuits
• Reviewing bounds on the circuit size of the hardest functions
• The complexity of computing symmetric functions using threshold circuits
• Minimal contact circuits for symmetric threshold functions
• Title not available (Why is that?)
• Dimension, entropy rates, and compression
• Complexity of Boolean functions over bases with unbounded fan-in gates
• On the computational complexity of finite functions and semigroup multiplication
• On implementation of some systems of elementary conjunctions in the class of separating contact circuits
• Correcting closures in contact circuits
• On the computational complexity of qualitative coalitional games
• On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs

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