The Binary Linearization Complexity of Pseudo-Boolean Functions (Q6423449)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Binary Linearization Complexity of Pseudo-Boolean Functions |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Binary Linearization Complexity of Pseudo-Boolean Functions |
preprint article from arXiv |
Statements
15 January 2023
0 references
cs.DM
0 references
math.OC
0 references
Matthias Walter
0 references
