Buttons & Scissors is NP-Complete.
Harrison GreggJody LeonardAaron SantiagoAaron WilliamsPublished in: CCCG (2015)
Keyphrases
- np complete
- computational complexity
- np hard
- randomly generated
- constraint satisfaction problems
- polynomial time complexity
- satisfiability problem
- polynomially solvable
- conjunctive queries
- pspace complete
- np complete problems
- lower bound
- database systems
- artificial intelligence
- learning environment
- data integration
- computer vision
- bounded treewidth
- information retrieval