Title | MAXIMAL DEPTHS OF BOOLEAN FUNCTIONS |
Publication Type | Journal Article |
Year of Publication | 2004 |
Authors | Skordev D |
Journal | Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique |
Volume | 96 |
Keywords | algorithmic computability, Boolean function, complete set, maximal depth, Post theorem |
Abstract | Given any Boolean function, there is an upper bound of its depths with respect to arbitrary complete sets of such functions. We prove the algorithmic computability of the largest of these depths. |
2000 MSC | main 06E30, secondary 94C10 |
Attachment | Size |
---|---|
0996.pdf | 25.9 KB |
Attachment | Size |
---|---|
96-089-099.pdf | 918.84 KB |