Login / Signup
Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures.
Andreas Goerdt
Tomasz Jurdzinski
Published in:
Comb. Probab. Comput. (2003)
Keyphrases
</>
approximation algorithms
phase transition
special case
randomly generated
np hard
worst case
random instances
vertex cover
sat solvers
sat instances
bayesian networks
objective function
decision problems
random sat instances
easy hard easy pattern