Algebraic method to pseudo-Boolean function and its application in pseudo-Boolean optimization
Zhiqiang Li, Jinli Song, Huimin Xiao
Abstract
Zhiqiang Li, Jinli Song, Huimin Xiao
Abstract
In this paper, the optimization of pseudo-Boolean functions is considered. Boolean variables are expressed into their vector form. Using semi-tensor product, the pseudo-Boolean function is expressed as its normal form and algebraic form. Based on the normal form, we discuss the optimal approximation problem of pseudo-Boolean function.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, the optimization of pseudo-Boolean functions is considered. Boolean variables are expressed into their vector form. Using semi-tensor product, the pseudo-Boolean function is expressed as its normal form and algebraic form. Based on the normal form, we discuss the optimal approximation problem of pseudo-Boolean function.
Key concepts: Product term, Boolean function, Parity function, Boolean expression, Two-element Boolean algebra, Maximum satisfiability problem, Boolean network, Boolean algebras canonically defined