Biology, asked by sakshay6769, 1 year ago

Can polynomial complexity problems be reduced to np complete

Answers

Answered by sanjuhoney

In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes. ... In this context "quickly" means in polynomial time. That is, "efficient" or "fast" algorithms can be developed to solve the problem.

Previous Question

Next Question

Similar questions

English, 6 months ago

| H-atom के परमाणुविक स्पैक्ट्रम में पाये जाने वाली स्पैक्ट्रल रेखाओं के नाम लिखिए। Write the names of spectral lines obtained in the spectrum of H-atom. Am Aft...

Science, 6 months ago

Which of the following statement is incorrect All changes in the weather are caused by the sun Rain Gauge is a measuring cylinder with a funnel on top to collect rainwater The maximum and minimum temperature displayed daily in the weather bulletin is the recorded highest day temperature and lowest night temperature of the day Since very few preys are available, the polar bear does not need to...

Math, 6 months ago

Write 209.9 in the place value chart...

Biology, 1 year ago

Best expalination of molecular movements in human body...

Physics, 1 year ago

Can a moving charged particle speed up or speed down in a magnetic field...

Hindi, 1 year ago

Khoi hui vastu lotane ke liye kisi aparichit Ko letter likhkar aabhar vyakt kijiye...

Physics, 1 year ago

a t tumbler filled with water has an inverted tube with Mercury if the air pressure is more outside what will be the level of Mercury...

Hindi, 1 year ago

अनुच्छेद और धारा में क्या अंतर है? क्या कोई अनुच्छेद धारा या कोई धारा अनुच्छेद बन सकती है?