Lower bounds for restricted read-once parity branching programs.

Matthias Homeister

Published in: Theor. Comput. Sci. (2006)

Keyphrases

lower bound
max sat
upper bound
branch and bound algorithm
branch and bound
vc dimension
objective function
np hard
upper and lower bounds
quadratic assignment problem
error correction
lower and upper bounds
optimal solution
worst case
sample complexity
tabu search
pruning algorithms
min sum
read once formulas