On the NP-Isomorphism Problem with Respect to Random Instances.

Jie Wang Jay Belanger

Published in: J. Comput. Syst. Sci. (1995)

Keyphrases

random instances
phase transition
randomly generated
np complete
lower bound
computational complexity
np hard
branch and bound algorithm
random constraint satisfaction problems
orders of magnitude
sat instances
hard problems
pattern databases