3-SAT ≤p TSP
If P ¹ NP, then no NP-complete problem can be solved in polynomial time.
both the statements are true.
<u>Explanation:</u>
- 3-SAT ≤p TSP due to any complete problem of NP to other problem by exits of reductions.
- If P ¹ NP, then 3-SAT ≤p 2-SAT are the polynomial time algorithm are not for 3-SAT. In P, 2-SAT is found, 3- SAT polynomial time algorithm implies the exit of reductions. 3 SAT does not have polynomial time algorithm when P≠NP.
- If P ¹ NP, then no NP-complete problem can be solved in polynomial time. because for the NP complete problem individually gets the polynomial time algorithm for the others. It may be in P for all the problems, the implication of latter is P≠NP.
Answer:
<em><u>The 'shoulder' of a road is the land to the edge of the road. On most roads without pavements, the shoulder is a strip of grass or a hedgerow. This is known as a 'soft shoulder'. On a motorway, this strip of land is hardstanding, hence the name 'hard shoulder.'</u></em>
<em><u>Mark</u></em><em><u> </u></em><em><u>as</u></em><em><u> brilliant</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u> </u></em>
Why did you put this on here when you know the answer lol
Answer:
Maximum height=7.3535 m
Explanation:
Solution of the problem is given in the attachments.
