| 觀看：62 次｜回覆：0 則 |
 |
||
| Name：Marioncholo | 25, Mar, 2024 20:16:35 | |
 |
which means that they always find an optimal solution. Demanding the solution to be optimal means that other concessions have to be made when designing an exact algorithm for an NP hard problem: we either have to impose restrictions on the instances of the problem in order to achieve a polynomial ti | |
 |
||
回覆留言