Marginal hitting sets imply super-polynomial lower bounds for permanent.

Maurice J. Jansen Rahul Santhanam

Published in: ITCS (2012)

Keyphrases

lower bound
upper bound
branch and bound
branch and bound algorithm
lower and upper bounds
lower bounding
np hard
objective function
probability distribution
markov chain
upper and lower bounds
randomly generated problems
database
data sets
optimal solution
worst case