A decomposition method for minimizing quadratic pseudo-Boolean functions (Q1118533): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5615282 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Uniquely solvable quadratic Boolean equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Latest revision as of 13:51, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decomposition method for minimizing quadratic pseudo-Boolean functions |
scientific article |
Statements
A decomposition method for minimizing quadratic pseudo-Boolean functions (English)
0 references
1989
0 references
A decomposition method is proposed for minimizing quadratic pseudo- Boolean functions. The result is: minimum of \(f=\sum^{q}_{i=1}\) (minimum of \(f_ i)\), where the function f is a sum of quadratic monomials, \(f_ i\) is a sum of monomials of f and each monomial of f appears in at most one \(f_ i\).
0 references
strongly connected components
0 references
quadratic pseudo-Boolean functions
0 references
0 references
