|
This article is cited in 4 scientific papers (total in 4 papers)
On pseudo-Boolean polynomials
V. K. Leont'ev Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, Russia
Abstract:
A pseudo-Boolean function is an arbitrary mapping of the set of binary $n$-tuples to the real line. Such functions are a natural generalization of classical Boolean functions and find numerous applications in various applied studies. Specifically, the Fourier transform of a Boolean function is a pseudo-Boolean function. A number of facts associated with pseudo-Boolean polynomials are presented, and their applications to well-known discrete optimization problems are described.
Key words:
pseudo-Boolean polynomial, monomial.
Received: 22.10.2014 Revised: 21.04.2015
Citation:
V. K. Leont'ev, “On pseudo-Boolean polynomials”, Zh. Vychisl. Mat. Mat. Fiz., 55:11 (2015), 1952–1958; Comput. Math. Math. Phys., 55:11 (2015), 1926–1932
Linking options:
https://www.mathnet.ru/eng/zvmmf10304 https://www.mathnet.ru/eng/zvmmf/v55/i11/p1952
|
Statistics & downloads: |
Abstract page: | 256 | Full-text PDF : | 85 | References: | 85 | First page: | 11 |
|