Now showing items 1-1 of 1
Step toward constant time local search for optimizing pseudo boolean functions, A
Format:born digital; masters theses
Pseudo Boolean Functions (PBFs) are the objective functions for a wide class of hard optimization problems, such as MAX-SAT and MAX-CUT. Since these problems are NP-Hard, researchers and practitioners rely on incomplete ...