On Quadratization of Pseudo-Boolean Functions
arXiv:1404.6538v160 citations
Originality Synthesis-oriented
AI Analysis
This work addresses a specific optimization problem in computational mathematics, presenting incremental advancements in quadratization techniques.
The paper tackles the problem of quadratizing high-degree pseudo-Boolean functions by introducing a new term-wise technique that allows multiple splits and the first aggregative approach based on common parts, resulting in improved methods for this optimization task.
We survey current term-wise techniques for quadratizing high-degree pseudo-Boolean functions and introduce a new one, which allows multiple splits of terms. We also introduce the first aggregative approach, which splits a collection of terms based on their common parts.