The following pages link to O. M. Kasim-Zade (Q226474):
Displayed 30 items.
- Depth of Boolean functions realized by circuits over an arbitrary infinite basis (Q355347) (← links)
- Orders of growth of Shannon functions for circuit complexity over infinite bases (Q469087) (← links)
- General upper bound of circuit complexity in an arbitrary infinite complete base (Q1275996) (← links)
- On the implicit expressibility of Boolean functions (Q1358182) (← links)
- On the complexity of schemes in an infinite basis (Q1358442) (← links)
- On classes of Boolean functions, invariant with respect to substitution of a single-variable function (Q1358555) (← links)
- On the synthesis of networks of functional elements (Q1380258) (← links)
- Implicit expressibility in two-valued logic and cryptoisomorphisms of two-element algebras (Q1380266) (← links)
- Behavior of Shannon functions for complexity of parametric representations of Boolean functions (Q1851549) (← links)
- A Note on a priori Estimations of Classification Circuit Complexity (Q3005902) (← links)
- (Q3050317) (← links)
- (Q3063985) (← links)
- (Q3115626) (← links)
- (Q3115629) (← links)
- (Q3309610) (← links)
- (Q3338113) (← links)
- (Q3364511) (← links)
- (Q3496295) (← links)
- (Q3541478) (← links)
- (Q3541511) (← links)
- (Q3615216) (← links)
- (Q3617454) (← links)
- (Q3885675) (← links)
- (Q3893834) (← links)
- (Q4230581) (← links)
- (Q4301461) (← links)
- (Q4830984) (← links)
- (Q4866344) (← links)
- (Q4936732) (← links)
- On minimal coverings of the Boolean cube by centered antichains (Q5954089) (← links)