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:that is associated with diarrhea in humans. ... Examples of giardia in a Sentence ... These example sentences are selected automatically from various online news sources to reflect current usage of the word 'giardia.
Explanation:
<u>Explanation:</u>
Task 1 time period = 200ms, Task 2 time period = 300ms
Task ticked =
→ 5 times
Task 2 ticked =
→ 3 times
At 600 ms → 200ms 200ms 200ms
300ms → 
Largest time period = H.C.M of (200ms, 300ms)
= 600ms
Answer:d
Explanation:
(d) chain drive belt drive gear drive
Answer:
a. 1.91 b. -8.13 mm
Explanation:
Modulus =stress/strain; calculating stress =F/A, hence determine the strain
Poisson's ratio =(change in diameter/diameter)/strain