A Paper on Pencils: A Pencil and Paper Puzzle - Pencils is NP-Complete.
Daniel PackerSophia WhiteAaron WilliamsPublished in: CCCG (2018)
Keyphrases
- np complete
- randomly generated
- constraint satisfaction problems
- computational complexity
- np hard
- e learning
- constraint satisfaction
- satisfiability problem
- conp complete
- conjunctive queries
- phase transition
- polynomial time complexity
- data sets
- np complete problems
- bounded treewidth
- probabilistic model
- search space
- optimal solution
- bayesian networks
- data mining