Math, asked by priyankajangid6123, 1 year ago

Are two np complete problems commutative under polynomial reducability

Answers

Answered by Dipali1111

3

I think yes it can be possible

Answered by brainly72

0

I think it can be.

hope it will help you

rajeshsingh88266: It can be possible....

rajeshsingh88266: It can't be possible...

Previous Question

Next Question

Similar questions

Biology, 8 months ago

please tell me the correct answer friends ...

English, 8 months ago

4.Find a term suggesting'a very wicked or cruel person' from the poem Macavity-The Mystery Cat.

Computer Science, 8 months ago

B. Answer the following as True or False. All the physical components of the computer system are known as hardware b. Computer can be used even if there is no software installed in it Language processors belong to the category of application software, d. Windows 7 is an example of Operating System Software, An Interpreter converts a high level language program into the machine codes line by line...

Physics, 1 year ago

A ray of light is incident at angle i on the surface of the prism...

Chemistry, 1 year ago

A solution containing 8.6gL−1 of urea (molar mass 60gmol−1) is isotonic with a 5% solution of unknown solute.The molar mass of the solute will be...

Math, 1 year ago

Find the length of the diameter of a circle whose circumference is 44 cm.

Science, 1 year ago

Why grade up mock test only one attamt ppossible?

Science, 1 year ago

Why formaldehyde is used for carbon precursors?