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

World Languages, 7 months ago

चल चलतम् चलत” इत्यत्र कः पुरुषः अस्ति ? प्रथमः मध्यमः उत्तमः अधमः ...

Math, 7 months ago

sides of right angle triangle are x cm , (x+1) cm and (x+2) cm, then find the value of x...

English, 7 months ago

Story of cut your coat according to your cloth...

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

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