Sequential Diagnosability is Co-NP Complete.
Vijay RaghavanAnand R. TripathiPublished in: IEEE Trans. Computers (1991)
Keyphrases
- np complete
- np hard
- randomly generated
- discrete event systems
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- pspace complete
- discrete event
- global consistency
- polynomial time complexity
- np complete problems
- fault diagnosis
- data complexity
- sequential data
- bounded treewidth
- data sets
- polynomially solvable