The following pages link to (Q5534931):
Displaying 13 items.
- The length of a read-many certificate in the basis of all functions of \(l\) variables (Q260328) (← links)
- On some series of bases for the set of Boolean functions (Q326283) (← links)
- Depth and polynomial equivalence of formulas for closed classes of two- valued logic (Q1097251) (← links)
- The complexity of the realization of symmetrical functions by formulae (Q1215614) (← links)
- Characteristic measures of switching functions (Q1243267) (← links)
- On almost bad Boolean bases (Q1349706) (← links)
- Iterated Boolean functions in the elementary basis (Q1759196) (← links)
- Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits (Q1946416) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- Read-once functions of the algebra of logic in pre-elementary bases (Q2011367) (← links)
- A new proof of Stetsenko's theorem (Q2018643) (← links)
- Parallelizable algebras (Q3773330) (← links)
- On an infinite sequence of improving Boolean bases (Q5954084) (← links)
