2864
Since it is unlikely that there exists a polynomial time solution for any of these hard problems -LRB- unless P = NP and P #P = P -RRB- , our results highlight and justify the need for developing polynomial time approximations for these computations .
 polynomial time solution, hard problems; polynomial time approximations, computations
Please list all entity pairs containing a certain relationship in the given options.Output format is "word1, word2; word3, word4". 
Option: conjunction, feature of, hyponym of, used for, part of, compare, evaluate for 
Text: {0} 
Answer:
 polynomial time solution, hard problems; polynomial time approximations, computations