scientific article
From MaRDI portal
Publication:3249579
zbMath0081.20902MaRDI QIDQ3249579
Publication date: 1958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Scaled dimension and nonuniform complexity ⋮ Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits ⋮ The complexity of depth-3 circuits computing symmetric Boolean functions ⋮ Complexity of Boolean functions over bases with unbounded fan-in gates ⋮ Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates ⋮ Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables ⋮ Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs ⋮ On implementation of some systems of elementary conjunctions in the class of separating contact circuits ⋮ Minimal contact circuits for symmetric threshold functions ⋮ Orders of growth of Shannon functions for circuit complexity over infinite bases ⋮ On algorithm complexity ⋮ Lower bounds against weakly-uniform threshold circuits ⋮ Almost everywhere high nonuniform complexity ⋮ The complexity of computing symmetric functions using threshold circuits ⋮ 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 ⋮ One-way permutations, computational asymmetry and distortion. ⋮ Asymptotical behaviour of some non-uniform measures ⋮ Circuit size relative to pseudorandom oracles ⋮ A class of Boolean functions with linear combinational complexity ⋮ Dimension, entropy rates, and compression ⋮ Unnamed Item ⋮ Characteristic measures of switching functions ⋮ On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts ⋮ Correcting closures in contact circuits ⋮ On the computational complexity of finite functions and semigroup multiplication ⋮ Reviewing bounds on the circuit size of the hardest functions ⋮ On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs ⋮ Mining circuit lower bound proofs for meta-algorithms ⋮ On the computational complexity of qualitative coalitional games
This page was built for publication:
