# Qual a complexidade de procp se a de procq é o n 2 o

• Notes
• 71

This preview shows pages 69–71. Sign up to view the full content.

Qual a complexidade de ProcP se a de ProcQ é: O (n 2 ) ? O (n) ? O (2 n ) ? 81 (5) Assumindo que N e NP são conjuntos, qual a relação entre eles ( , =, , etc) ? 82 (1) A expressão _ _ _ _ _ S = (a + b) (a + b + c) (a + b + c) c é satisfazível? 83 (2) Quais dos problemas abaixo pertencem a NP ? (a) Encontrar um elemento em um vetor que é maior do que todos os outros. (b) Associar cores aos vértices de um grafo de tal forma que dois vértices adjacentes possuam cores diferentes. 69

This preview has intentionally blurred sections. Sign up to view the full version.

(c) Se um algoritmo para S tiver complexidade O(n 2 ), qual seria a complexidade de um algoritmo para R obtido pela redução a S ? (d) Explique porque R e S são NP-completos. 71
This is the end of the preview. Sign up to access the rest of the document.
• Summer '00
• Aula4-IntroducaoC
• =, algoritmo dfs

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern