| other,8-5-E06-1004,ak | Since it is unlikely that there exists a <term> polynomial time solution </term> for any of these <term> hard problems </term> ( unless P = NP and P #P = P ) , our results highlight and justify the need for developing <term> polynomial time approximations </term> for these computations . | #10976 Since it is unlikely that there exists a polynomial time solution for any of these hard problems (unless P = NP and P#P = P), our results highlight and justify the need for developing polynomial time approximations for these computations. |
