Question

what is P-NP need answer now

Answer 1

@paki

Answer 2

Is there anything else to this problem?

Answer 3

p versus np

Answer 4

I'm sorry, but I'm afraid I don't understand the context. Is this for an equation, a triangle . . . ? Does p equal anything, does n equal anything?

Answer 5

it is the equation for the complexity of theorem proving procedure

Answer 6

@amistre64 @Gabebro13

Answer 7

@eliassaab

Answer 8

Whoah! Someone asked for my help!

Answer 9

asks whether polynomial time algorithms actually exist for NP-complete, and by corollary, all NP problems

Answer 10

@yamyam70 @YanaSidlinskiy

Answer 11

@flvsguy

Answer 12

@undeadknight26

Answer 13

Okay, so it would be n MINUS np?

Answer 14

uh, are you just posting peoples names you see online

Answer 15

nope

Answer 16

no
n versus np

Answer 17

The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. It was introduced in 1971 by Stephen Cook in his seminal paper "The complexity of theorem proving procedures"[2] and is considered by many to be the most important open problem in the field.[3] It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US$1,000,000 prize for the first correct solution.

Answer 18

wikipedia has the answer! http://en.wikipedia.org/wiki/P_versus_NP_problem

Answer 19

its unsolvable

Answer 20

I have no idea whats going on

Answer 21

really i thought it was

Answer 22

Hey @Law&Order I am sorry I couldn't hep some more. I am not really the best at math. If you ever need help with Biology though, just tag me and I can help.

Answer 23

This is what I'm going down to. "Just google it". That's the best that i could do..
http://www.google.com/?as_qdr=all#as_qdr=all&q=what+is+P-NP&safe=active