a_non_monotonic_function comments on There's a new way to break RSA that's faster than anything we've seen before

Technology

89,648 readers

13,807 active

2,300 users here now

This is a most excellent place for technology news and articles.

Our Rules

Follow the lemmy.world rules.
Only tech related news or articles.
Be excellent to each other!
Mod approved content bots can post up to 10 articles per day.
Threads asking for personal tech support may be deleted.
Politics threads may be removed.
No memes allowed as posts, OK to post as comments.
Only approved bots from the list below, this includes using AI responses and summaries. To ask if your bot can be added please contact a mod.
Check for duplicates before posting, duplicates may be removed
Accounts 7 days and younger will have their posts automatically removed.

Approved Bots

founded 3 years ago

moderators

[–] a_non_monotonic_function@lemmy.world 1 point 1 month ago

No, we don't use it as an adjective. It is a set. That's literally all it is.

And predicating anything on the assumption that P equals NP is rather absurd. Of course, we can't rule it out as a possibility. But virtually nobody in the discipline believes that to be the case. And honestly, why would it be? If there were polynomial time solutions to that many problems of that degree of importance, surely we would have discovered something by now.

permalink

fedilink

source

parent

[–] solrize@lemmy.ml 0 points 1 month ago*

No, we don’t use it as an adjective.

From the first sentence of https://en.wikipedia.org/wiki/NP-hardness : "In computational complexity theory, a computational problem H is called NP-hard if...".

Of course, we can’t rule it out as a possibility.

Exactly, we don't know for certain. Of course it's very unlikely, but in math when we say we know something for certain, it means there's a theorem to that effect. There reason to think that factoring is not NP-hard but we don't know for certain. If you still claim otherwise, can you cite a theorem?

Anyway, yes, you're confused, and at this point you're spouting misinformation. You might consider reading a book or taking a class.

If there were polynomial time solutions to that many problems of that degree of importance, surely we would have discovered something by now.

It's still an open problem, there's a $1 million Clay prize waiting for you to claim it if you have a proof either way.