Corpus ID: 15535213

On quadratization of pseudo-Boolean functions

@article{Boros2012OnQO,
  title={On quadratization of pseudo-Boolean functions},
  author={E. Boros and A. Gruber},
  journal={ArXiv},
  year={2012},
  volume={abs/1404.6538}
}
Set functions, i.e., real mappings form the family of subsets of a finite set to the reals are known and widely used in discrete mathematics for almost a century, and in particular in the last 50 years. If we replace a finite set with its characteristic vector, then the same set function can be interpreted as a mapping from the set of binary vectors to the reals. Such mappings are called pseudo-Boolean functions and were introduced in the works of Peter L. Hammer in the 1960s, see the seminal… Expand
41 Citations

Topics from this paper

Quadratization of Symmetric Pseudo-Boolean Functions
  • 17
  • PDF
Algorithmic and complexity results for boolean and pseudo-boolean functions
  • 2
Non-expressibility of Submodular Languages
A Polyhedral Study of Binary Polynomial Programs
  • 25
  • PDF
Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions
  • 18
  • PDF
Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions
  • 5
A polyhedral study of multilinear programs with box constraints
  • PDF
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph
  • 2
  • Highly Influenced
  • PDF
Quadratic reformulations of nonlinear binary optimization problems
  • 20
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Recognition problems for special classes of polynomials in 0–1 variables
  • Y. Crama
  • Mathematics, Computer Science
  • Math. Program.
  • 1989
  • 56
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
  • 57
  • Highly Influential
The expressive power of binary submodular functions
  • 38
  • PDF
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
  • 162
  • PDF
Pseudo-Boolean optimization
  • 775
  • PDF
The ellipsoid method and its consequences in combinatorial optimization
  • 1,938
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
  • 33
Classes of submodular constraints expressible by graph cuts
  • 26
  • PDF
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
  • 43
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
  • A. Schrijver
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • 2000
  • 644
  • PDF
...
1
2
3
...