The following pages link to (Q3249579):
Displaying 29 items.
- Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates (Q334289) (← links)
- Orders of growth of Shannon functions for circuit complexity over infinite bases (Q469087) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts (Q735558) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
- Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- Reviewing bounds on the circuit size of the hardest functions (Q1041784) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- A class of Boolean functions with linear combinational complexity (Q1223937) (← links)
- Characteristic measures of switching functions (Q1243267) (← links)
- Complexity of Boolean functions over bases with unbounded fan-in gates (Q1350754) (← links)
- Scaled dimension and nonuniform complexity (Q1880776) (← links)
- 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 (Q1996847) (← links)
- On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs (Q2081007) (← links)
- Minimal contact circuits for symmetric threshold functions (Q2210380) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- On algorithm complexity (Q2453388) (← links)
- Dimension, entropy rates, and compression (Q2495412) (← links)
- Correcting closures in contact circuits (Q2534413) (← links)
- On the computational complexity of finite functions and semigroup multiplication (Q2548857) (← links)
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits (Q2628763) (← links)
- Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs (Q2685510) (← links)
- On implementation of some systems of elementary conjunctions in the class of separating contact circuits (Q2688837) (← links)
- Asymptotical behaviour of some non-uniform measures (Q3833644) (← links)
- (Q5091223) (← links)
