On a class of bases for boolean functions
| Autor: | Dimiter Skordev |
|---|---|
| Rok vydání: | 2009 |
| Předmět: |
Statistics and Probability
Discrete mathematics Product term Parity function Applied Mathematics General Mathematics Two-element Boolean algebra Boolean circuit Boolean algebras canonically defined Complete Boolean algebra Combinatorics Boolean expression Stone's representation theorem for Boolean algebras GeneralLiterature_REFERENCE(e.g. dictionaries encyclopedias glossaries) Mathematics |
| Zdroj: | Journal of Mathematical Sciences. 158:753-758 |
| ISSN: | 1573-8795 1072-3374 |
| DOI: | 10.1007/s10958-009-9398-y |
| Popis: | We prove that up to congruence there exist exactly fourty-four primitive bases of Boolean functions. We also apply our results in order to improve an algorithm of finding the maximal strong depth of a Boolean function. Bibliography: 4 titles. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|