"Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions."

Matthias Walter (2024)

> Home

Details and statistics

DOI: 10.5802/OJMO.34

access: open

type: Journal Article

metadata version: 2025-01-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ojmo/Walter24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ojmo/Walter24
Matthias Walter:
Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions. Open J. Math. Optim. 5: 1-12 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.