Pages that link to "Item:Q4553643"
From MaRDI portal
The following pages link to On the Complexity of Multivalued Logic Functions over Some Infinite Basis (Q4553643):
Displaying 10 items.
- Realization of \(k\)-valued functions by circuits of functional elements (Q1290818) (← links)
- Asymptotics of growth for non-monotone complexity of multi-valued logic function systems (Q1685402) (← links)
- The minimum number of negations in circuits for systems of multi-valued functions (Q1744290) (← links)
- On the depth of \(k\)-valued logic functions over arbitrary bases (Q1791766) (← links)
- Circuit complexity of \(k\)-valued logic functions in one infinite basis (Q2319830) (← links)
- (Q3368924) (← links)
- Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases (Q4220200) (← links)
- ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC (Q5150696) (← links)
- The conditional distribution of the output of an automaton without memory for given characteristics of the input (Q5904027) (← links)
- Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions (Q6114318) (← links)
