Pages that link to "Item:Q4220200"
From MaRDI portal
The following pages link to Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases (Q4220200):
Displaying 14 items.
- Complexity of realization of functions from a class of three-valued logic by formulas of special type (Q355253) (← links)
- On recognition complexity for systems of functions in the class \(P^*_3\) (Q1280364) (← links)
- Realization of \(k\)-valued functions by circuits of functional elements (Q1290818) (← links)
- On the complexity of deciphering the threshold functions of \(k\)-valued logic (Q1594168) (← links)
- On the implementation of functions by circuits and formulas over functionally complete bases (Q1594381) (← links)
- Realization of functions in \(P_k\) by circuits of functional elements over an arbitrary basis (Q1594916) (← links)
- Asymptotics of growth for non-monotone complexity of multi-valued logic function systems (Q1685402) (← links)
- Circuit complexity of \(k\)-valued logic functions in one infinite basis (Q2319830) (← links)
- Complexity of implementation of parity functions in the ``implication-negation'' basis (Q2820943) (← links)
- (Q3368924) (← links)
- On lower bounds for the complexity of vector systems of k-valued logic (Q4522799) (← links)
- On the Complexity of Multivalued Logic Functions over Some Infinite Basis (Q4553643) (← links)
- ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC (Q5150696) (← links)
- Circuit complexity and the expressive power of generalized first-order formulas (Q5204302) (← links)
