Login / Signup
Simplified Harvest Moon is NP-Complete.
Steven Braeger
Published in:
Tiny Trans. Comput. Sci. (2012)
Keyphrases
</>
np complete
np hard
randomly generated
satisfiability problem
computational complexity
pspace complete
constraint satisfaction problems
polynomially solvable
focused crawling
conjunctive queries
bounded treewidth
data complexity
artificial intelligence
np complete problems