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:
to plan, design, and oversee the construction of a building
Answer:
<u><em>To answer this question we assumed that the area units and the thickness units are given in inches.</em></u>
The number of atoms of lead required is 1.73x10²³.
Explanation:
To find the number of atoms of lead we need to find first the volume of the plate:

<u>Where</u>:
A: is the surface area = 160
t: is the thickness = 0.002
<u><em>Assuming that the units given above are in inches we proceed to calculate the volume: </em></u>
Now, using the density we can find the mass:

Finally, with the Avogadros number (
) and with the atomic mass (A) we can find the number of atoms (N):
Hence, the number of atoms of lead required is 1.73x10²³.
I hope it helps you!