| Article ID: | iaor2008414 |
| Country: | Belarus |
| Volume: | 51 |
| Issue: | 1 |
| Start Page Number: | 9 |
| End Page Number: | 11 |
| Publication Date: | Jan 2007 |
| Journal: | Doklady of the National Academy of Sciences of Belarus |
| Authors: | Zakrevskij A.D. |
| Keywords: | heuristics |
A new heuristic algorithm for Boolean functions decomposition is suggested. The problem is reduced to the random search for a suitable simplest partition on the set of arguments and its successive expansion.