scientific article; zbMATH DE number 3133387

Cited in

(32)

Reviewing bounds on the circuit size of the hardest functions
Almost everywhere high nonuniform complexity
The complexity of computing symmetric functions using threshold circuits
Circuit size relative to pseudorandom oracles
A class of Boolean functions with linear combinational complexity
Characteristic measures of switching functions
Complexity of Boolean functions over bases with unbounded fan-in gates
Scaled dimension and nonuniform complexity
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
On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs
Minimal contact circuits for symmetric threshold functions
Mining circuit lower bound proofs for meta-algorithms
On algorithm complexity
Dimension, entropy rates, and compression
Correcting closures in contact circuits
On the computational complexity of finite functions and semigroup multiplication
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
On implementation of some systems of elementary conjunctions in the class of separating contact circuits
Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
Asymptotical behaviour of some non-uniform measures
Orders of growth of Shannon functions for circuit complexity over infinite bases
Lower bounds against weakly-uniform threshold circuits
\(\mathrm{AC}^0[p]\) lower bounds against MCSP via the coin problem
The contact process with switching
NP-hardness of approximating meta-complexity: a cryptographic approach
Symmetric exponential time requires near-maximum circuit size
On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts
On the computational complexity of qualitative coalitional games
The complexity of depth-3 circuits computing symmetric Boolean functions
Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
One-way permutations, computational asymmetry and distortion.

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)