Fillmat is NP-Complete and ASP-Complete.
Akihiro UejimaHiroaki SuzukiPublished in: J. Inf. Process. (2015)
Keyphrases
- np complete
- pspace complete
- randomly generated
- np hard
- computational complexity
- answer set programming
- satisfiability problem
- constraint satisfaction problems
- web applications
- polynomial time complexity
- polynomially solvable
- model checking
- information retrieval
- bayesian networks
- description logics
- database systems
- decision trees
- information systems
- conjunctive queries
- genetic algorithm
- real world
- neural network
- np complete problems
- databases
- computationally complex
- database