There is no proof that factoring semiprimes is NP complete nor that it is NP Hard. Breaking RSA would not be a proof of P=NP Computer Science

---

• There is no proof that factoring semiprimes is NP complete nor that it is NP Hard. Breaking RSA would not be a proof of P=NP
• Article of Mario NP-hardness?
• Starting a Vblog
• Silicon to Software
• Would it be feasible to replace the TeX/LaTeX test to determine whether a CS paper is worth reading by a test that looks at paper CONTENT via machine learning and performs at least as well as the TeX/LaTeX test?

There is no proof that factoring semiprimes is NP complete nor that it is NP Hard. Breaking RSA would not be a proof of P=NP Posted: 08 May 2021 10:36 PM PDT I was motivated to make this post in reaction to the massive confusion displayed in the comments of a nearby thread. It is possible that integer factoring was always in class P all along, and so some shifty eyed anonymous internet person cracking RSA challenges would only indicate that an efficient algorithm exists for factoring. Nevertheless, almost a dozen posters on that other thread are asking OP to crack RSA as a way to indicate he is in possession of a constructive proof of P=NP. Again this would be no indication of such a proof. submitted by /u/vwibrasivat [link] [comments]

Article of Mario NP-hardness? Posted: 08 May 2021 09:21 AM PDT Hi, I remember a few years ago I read an article that proved Mario is an NP-hard game. I believe it even showed it was PP-hard. Does anyone have a link to this article? I can't seem to find it. Thanks! submitted by /u/ctm-8400 [link] [comments]

Starting a Vblog Posted: 09 May 2021 12:19 AM PDT Good day to everyone! I am planning to start a vblog about different websites. Do you have any advice or tips about it. ​ Thank you! submitted by /u/codeMDC [link] [comments]

Silicon to Software Posted: 08 May 2021 04:20 PM PDT This is a question: can someone explain the micro-to-macro relationship from silicon (basically, sand) to planet-scale networks and software? It is fascinating that all this has come up in last 2-3 generations! submitted by /u/sabzi32 [link] [comments]

Would it be feasible to replace the TeX/LaTeX test to determine whether a CS paper is worth reading by a test that looks at paper CONTENT via machine learning and performs at least as well as the TeX/LaTeX test? Posted: 08 May 2021 01:41 PM PDT submitted by /u/amichail [link] [comments]

You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now.	Email delivery powered by Google
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States