Recognition problems for special classes of polynomials in 0–1 variables |
| |
Authors: | Yves Crama |
| |
Institution: | (1) Capaciteitsgroep Kwantitatieve Economie, Rijksuniversiteit Limburg, Postbus 616, 6200 MD Maastricht, The Netherlands |
| |
Abstract: | This paper investigates the complexity of various recognition problems for pseudo-Boolean functions (i.e., real-valued functions defined on the unit hypercubeB
n
= {0, 1}
n
), when such functions are represented as multilinear polynomials in their variables. Determining whether a pseudo-Boolean function (a) is monotonic, or (b) is supermodular, or (c) is threshold, or (d) has a unique local maximum in each face ofB
n
, or (e) has a unique local maximum inB
n
, is shown to be NP-hard. A polynomial-time recognition algorithm is presented for unimodular functions, previously introduced by Hansen and Simeone as a class of functions whose maximization overB
n
is reducible to a network minimum cut problem. |
| |
Keywords: | Nonlinear 0– 1 optimization pseudo-Boolean functions monotonicity supermodularity local extrema unimodularity NP-completeness |
本文献已被 SpringerLink 等数据库收录! |
|