Personal tools

You are here: Home → Annual of University of Sofia → Tomes archive → Tome 96 → Maximal depths of Boolean functions

Home
Departments
Education
PhD Students
Students' Mobility
International students
Projects at FMI
Annual of University of Sofia
Contacts

Maximal depths of Boolean functions

Author: Dimiter Skordev

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.

Annotation in PDF format:

(PDF document 25Kb)

Keywords: Boolean function, complete set, Post theorem, maximal depth, algorithmic computability

2000 MSC: main 06E30, secondary 94C10