The analysis of partial truth tables (information theory)
Robert E. Peile · IEEE Transactions on Information Theory · 1991
The structures of partially evaluated Boolean functions are examined, along with the problems that appear when the functions are known on all or most of the inputs of constant weight. Several basic structural theorems are presented. Connections with related areas of mathematics are emphasized. However, the focus is on the algorithmic and computational aspects of the methods. Tests for the order of a function are described and illustrated.>