Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs.

Henrik Brosenne Matthias Homeister Stephan Waack

Published in: MFCS (2003)

Keyphrases

lower bound
upper bound
special case
max sat
machine learning
np hard
graph model
worst case
graph representation
weighted graph
branch and bound algorithm
min sum
upper and lower bounds
bipartite graph
graph matching
branch and bound
scheduling problem
search algorithm