Login / Signup
Automatic Evaluation of Reductions between NP-Complete Problems.
Carles Creus
Pau Fernández
Guillem Godoy
Published in:
SAT (2014)
Keyphrases
</>
automatic evaluation
np complete problems
np complete
graph coloring
phase transition
quality assessment
hard problems
sat problem
human judgments
satisfiability problem
combinatorial problems
computational complexity
decision problems
constraint satisfaction
randomly generated