Vol. 37(51), pp. 3--6 (1985)
Some remarks on the canonical form for pseudo-Boolean functions
Radomir S. Stankovi\'c
Abstract: We consider some canonical forms for pseudo-Boolean functions and give a fast algorithm for the determination of these forms. We also show that the coefficients of all $m^n$ possible different canonical forms may be computed simultaneously by using the fast convolution algorithms.
Classification (MSC2000): 03B50
Full text of the article:
Electronic fulltext finalized on: 2 Nov 2001. This page was last modified: 16 Nov 2001.
© 2001 Mathematical Institute of the Serbian Academy of Science and Arts