Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

1
  • 1
    $\begingroup$ "in comparison with the hardest non-polynomial time especially the so called NP-Complete" -- NP-complete problems are not known to be non-polynomial, and they are certainly not the hardest. $\endgroup$
    – Raphael
    Commented Nov 27, 2017 at 21:38