No NP Problems Averaging Over Ranking of Distributions are Harder.

Jay Belanger Jie Wang

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

Keyphrases

np complete
np hard
problems involving
optimization problems
real time
probabilistic model
ranking algorithm
lower bound
evolutionary algorithm
probability distribution
rank aggregation