New! You can now keep track of new articles from Discrete Mathematics and Applications on your personalized homepage!
A Boolean function g is said to be an annihilator of a Boolean function f if fg = 0. In some problems concerning finite automata, it is required to find non-zero annihilators of low algebraic degree for a function f . In this paper we suggest Algorithm M2 which, given the Zhegalkin polynomial for...
The problem of packing rectangles into several strips is considered. It is shown that for this problem there exist on-line algorithms with multiplicative error asymptotically close to 2 e , where e is the base of the natural logarithm. It is proved that none of the on-line algorithms can have the...