Skip to main navigation
Skip to search
Skip to main content
University of Twente Research Information Home
Home
Profiles
Research units
Projects
Research output
Datasets
Activities
Prizes
Press/Media
Search by expertise, name or affiliation
The Binary Linearization Complexity of Pseudo-Boolean Functions
Matthias Walter
Mathematics of Operations Research
Research output
:
Working paper
›
Preprint
›
Academic
41
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The Binary Linearization Complexity of Pseudo-Boolean Functions'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Complexity
100%
Boolean Function
100%
Integer-Linear Programming
50%
Correlation
25%
Auxiliary Variable
25%
Binary Sequence
25%
Programming Model
25%