“NP-hard”可以造什么句，NP-hard造句
来源：语文精选馆 2.41W
The minimum distance decoding of linear codes is NP-hard, but some solvable cases exist.
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
Some Efficient Algorithms for NP-hard Program;
MultiDepot Open Vehicle Routing Problem with soft time windows is a variation of the Vehicle Routing Problem con- strained by multidepot and soft time windows, which is a typical NP-hard problem.
For general graph, it is a NP-hard question to get the bondage number or reinforcement number.
