OptP as the Normal Behavior of NP-Complete Problems.
William I. GasarchMark W. KrentelKevin J. RappoportPublished in: Math. Syst. Theory (1995)
Keyphrases
- np complete problems
- normal behavior
- anomaly detection
- np complete
- intrusion detection
- intrusion detection system
- graph coloring
- anomalous behavior
- phase transition
- previously unknown
- hard problems
- combinatorial problems
- constraint satisfaction
- decision problems
- sat problem
- job shop scheduling
- np hard
- genetic algorithm
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- randomly generated
- expectation maximization
- scheduling problem