Is it possible to solve a non-deterministic polynomial time-hard problem with a polynomial-time algorithm?

1 ⤊

Is it possible to solve a non-deterministic polynomial time-hard problem with a polynomial-time algorithm?

2006-06-13 06:31:04 · 3 answers · asked by crackerheads 2 in Science & Mathematics ➔ Mathematics

3 answers

This is the question described in shorthand by computer scientists as does P = NP? The answer is the problem has never been solved, so you can't be certain. But most likely it isn't possible.

2006-06-13 06:43:09 · answer #1 · answered by A M Frantz 7 · 1⤊ 0⤋

Of course. Have you looked at the theory of thermal dynamics as it relates to the binary influx hexagon

2006-06-13 13:41:06 · answer #2 · answered by Answers 1 · 0⤊ 0⤋

As of yet, No.

2006-06-13 13:43:49 · answer #3 · answered by ag_iitkgp 7 · 0⤊ 0⤋