The following pages link to D. Yu. Cherukhin (Q239987):
Displaying 21 items.
- On Boolean bases directly preceding the basis \(\{\& ,\vee,\neg\}\). (Q1432146) (← links)
- On the comparison of Boolean bases (Q1594495) (← links)
- Realization of linear functions by formulas in various bases (Q1866895) (← links)
- Boolean circuits with a bounded depth of branching (Q2455319) (← links)
- The complexity of depth-two information networks (Q2513042) (← links)
- (Q3115554) (← links)
- On complexity of linear operators on the class of circuits of depth 2 (Q3184524) (← links)
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912) (← links)
- (Q3412385) (← links)
- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates (Q3503631) (← links)
- (Q4406622) (← links)
- On the premaximal Boolean bases (Q4522823) (← links)
- On the complexity of realization of the linear function by formulas over finite Boolean bases (Q4522865) (← links)
- (Q4528866) (← links)
- (Q4528867) (← links)
- (Q4530739) (← links)
- (Q4788068) (← links)
- On the complexity of unitary transformations (Q4809642) (← links)
- On circuits of functional elements of finite depth of branching (Q5424087) (← links)
- (Q5445408) (← links)
- The complexity hierarchy of Boolean bases (Q5960222) (← links)