Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds.

Harry Buhrman Leen Torenvliet Falk Unger

Published in: STACS (2006)

Keyphrases

lower bound
polynomial size
exponential size
upper bound
random instances
dnf formulas
branch and bound
lower and upper bounds
optimal solution
boolean functions
branch and bound algorithm
upper and lower bounds
np hard
objective function
vc dimension
bounded treewidth
theoretical analysis
worst case