Login / Signup

A probabilistic analysis of randomly generated binary constraint satisfaction problems.

Martin E. DyerAlan M. FriezeMichael Molloy
Published in: Theor. Comput. Sci. (2003)
Keyphrases
  • randomly generated
  • data analysis
  • np complete
  • branch and bound algorithm