Article
Licensed
Unlicensed
Requires Authentication
An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
-
V. V. Baev
Published/Copyright:
December 10, 2007
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 a function f, yields a basis of the space of its annihilators of degree not exceeding d. Algorithm M2 is an enhancement of a previously known algorithm and allows in a series of cases to decrease calculations. The total complexity of Algorithm M2 is the same as for the previous algorithm.
Received: 2007-May-18
Published Online: 2007-12-10
Published in Print: 2007-12-11
© de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The limit distribution of the size of a giant component in an Internet-type random graph
- On conditions for emergence of a giant tree in a random unlabelled forest
- On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another
- A multiple optimal stopping rule for sums of independent random variables
- The cycle structure of a random nonhomogeneous hypergraph on the subcritical stage of evolution
- On the structure of the set of reversible cellular automata
- On-line algorithms for packing rectangles into several strips
- An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
Articles in the same Issue
- The limit distribution of the size of a giant component in an Internet-type random graph
- On conditions for emergence of a giant tree in a random unlabelled forest
- On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another
- A multiple optimal stopping rule for sums of independent random variables
- The cycle structure of a random nonhomogeneous hypergraph on the subcritical stage of evolution
- On the structure of the set of reversible cellular automata
- On-line algorithms for packing rectangles into several strips
- An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
