Verifying Structurally Weakly Persistent Net Is Co-NP Complete.
Atsushi OhtaKohkichi TsujiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2011)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- conjunctive queries
- model checking
- sat problem
- phase transition
- neural network
- polynomial time complexity
- conp complete
- polynomially solvable
- np complete problems
- data complexity
- databases
- desirable properties
- reinforcement learning
- pspace complete
- case study
- website
- real world
- computationally complex
- helmholtz principle