The existence of an algorithm with polynomial time complexity which determines whether a system of Boolean functions realized in the form of Zhegalkin polynomial is complete is proved. It is also proved that if / is the length and r is the rank of the polynomial for a Boolean function, then / > \flJ -1 for a self-dual function and / > ^/2' : for an even function.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.