You are viewing a single comment's thread from:

RE: The P vs. NP Problem

in #steemstem • 8 years ago (edited)

Yes indeed. That's the whole point of NP-completeness. I was thinking of non-constructive proofs. I mean Polynomial time doesn't necessarily mean it will be quick. If someone comes up with, say O(n100), that wouldn't be practical. But I clearly messed up.

I made the correction. Thanks for the feedback!

8 years ago in #steemstem by
$0.00
    Reply 0

    Coin Marketplace

    STEEM 0.04
    TRX 0.33
    JST 0.101
    BTC 63835.32
    ETH 1798.30
    USDT 1.00
    SBD 0.38