Pages that link to "Item:Q1594495"
From MaRDI portal
The following pages link to On the comparison of Boolean bases (Q1594495):
Displaying 14 items.
- On a class of bases for Boolean functions (Q843614) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- Comparison of Boolean algebras (Q1101111) (← links)
- On almost bad Boolean bases (Q1349706) (← links)
- Complexity of automata evaluating formulas (Q1382592) (← links)
- Realization of Boolean functions by formulas in continuous bases containing a continuum of constants (Q1938644) (← links)
- Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits (Q1946416) (← links)
- Boole vs Wadge: comparing two basic tools of descriptive set theory (Q2104278) (← links)
- (Q3829489) (← links)
- Permutation and phase independent Boolean comparison (Q4307635) (← links)
- On the premaximal Boolean bases (Q4522823) (← links)
- On the complexity of realization of the linear function by formulas over finite Boolean bases (Q4522865) (← links)
- (Q4721957) (← links)
- Statistical estimation of the structure of a finite population (Q5894655) (← links)