Pages that link to "Item:Q2088739"

The following pages link to Refined bounds on Shannon's function for complexity of circuits of functional elements (Q2088739):

Displaying 15 items.

• Orders of growth of Shannon functions for circuit complexity over infinite bases (Q469087) (← links)
• Asymptotically best synthesis methods for reflexive-recursive circuits (Q830987) (← links)
• Asymptotic behavior of the Shannon function for a class of circuits of functional elements. (Q1284339) (← links)
• Asymptotics of the Shannon function for switching circuits in the ``Sheffer stroke'' basis with partial unreliability (Q1310741) (← links)
• The asymptotically best method for synthesizing limited-depth Boolean recursive schemes (Q1706039) (← links)
• Behavior of Shannon functions for complexity of parametric representations of Boolean functions (Q1851549) (← links)
• High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables (Q2319831) (← links)
• Asymptotic bounds of the Shannon function for a depth model of functional-element networks with capacity parameters for element outputs (Q2332035) (← links)
• High-accuracy asymptotic bounds for the realization complexity of function systems by iterative contact circuits (Q2458129) (← links)
• Bounds for code length for circuits of functional elements (Q3835753) (← links)
• A lower estimate of the Shannon function for contact schemes without zero chains (Q3983322) (← links)
• The Shannon function for calculating the Arnold complexity of length 2 n binary words (Q5263796) (← links)
• (Q5264733) (← links)
• (Q5684585) (← links)
• Statistical estimation of the structure of a finite population (Q5894654) (← links)