On Quadratization of Pseudo-Boolean Functions

04/25/2014
by   Endre Boros, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2022

On Symmetric Pseudo-Boolean Functions: Factorization, Kernels and Applications

A symmetric pseudo-Boolean function is a map from Boolean tuples to real...
research
09/15/2023

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization

With the goal of obtaining strong relaxations for binary polynomial opti...
research
10/31/2021

PIE: Pseudo-Invertible Encoder

We consider the problem of information compression from high dimensional...
research
08/29/2023

Pseudo-Boolean Polynomials Approach To Edge Detection And Image Segmentation

We introduce a deterministic approach to edge detection and image segmen...
research
08/29/2023

A Pseudo-Boolean Polynomials Approach for Image Edge Detection

We introduce a novel approach for image edge detection based on pseudo-B...
research
08/02/2019

Merging variables: one technique of search in pseudo-Boolean optimization

In the present paper we describe new heuristic technique, which can be a...
research
07/27/2010

Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions

With this paper, we contribute to the understanding of ant colony optimi...

Please sign up or login with your details

Forgot password? Click here to reset