Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent.

Maurice J. Jansen Rahul Santhanam

Published in: Electron. Colloquium Comput. Complex. (2011)

Keyphrases

lower bound
upper bound
lower and upper bounds
branch and bound algorithm
probability distribution
branch and bound
low order
average case complexity
neural network
genetic algorithm
objective function
special case
np hard
statistical queries
lower bounding
randomly generated problems