The following pages link to (Q3615217):
Displaying 16 items.
- On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts (Q735558) (← links)
- Asymptotically best method for synthesis of Boolean recursive circuits (Q783110) (← links)
- Asymptotically best synthesis methods for reflexive-recursive circuits (Q830987) (← links)
- Realization of Boolean functions by combinational circuits embedded in the hypercube (Q949222) (← links)
- One approach to synthesizing predicate circuits on the basis of generalized variables (Q1759101) (← links)
- On the synthesis and complexity of formulae with bounded depth of alternation (Q1759151) (← links)
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (Q2018028) (← links)
- Ways of synthesizing binary programs admitting recursive call of procedures (Q2058706) (← links)
- Refined bounds on Shannon's function for complexity of circuits of functional elements (Q2088739) (← links)
- Depth of schemes embedded in a unit cube and implementing typical Boolean functions (Q2191013) (← links)
- High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables (Q2319831) (← links)
- High-accuracy asymptotic bounds for the realization complexity of function systems by iterative contact circuits (Q2458129) (← links)
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits (Q2628763) (← links)
- Синтез асимптотически оптимальных по сложности схем из функциональных элементов, защищенных от раскрытия функциональности (Q3381881) (← links)
- (Q5092482) (← links)
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION (Q5151088) (← links)
