P versus NP Problem: Is P = NP?

Re: P versus NP Problem: Is P = NP?

Postby Guest » Sat Dec 04, 2021 9:22 pm

FYI: 'Abel Prize 2021: Honoring the Ties Between Computer Science and Mathematics',

https://ddcolrs.wordpress.com/2021/11/30/abel-prize-2021-honoring-the-ties-between-computer-science-and-mathematics/.

Yes! P=NP!
Attachments
P_np_np-complete_np-hard.svg.png
Yes! P=NP! "More technically, P versus NP asks: Does the ability to verify a solution in polynomial time imply one can also produce one in polynomial time? The question launched the field of computational complexity theory and forms the context for much of the work of the two laureates."
P_np_np-complete_np-hard.svg.png (5.5 KiB) Viewed 2736 times
Guest
 

Re: P versus NP Problem: Is P = NP?

Postby Guest » Wed Jan 12, 2022 4:43 am

FYI: 'Researcher develops new tool for understanding hard computational problems that appear intractable
by Steve Nadis , Massachusetts Institute
',

https://phys.org/news/2022-01-tool-hard-problems-intractable.html.
Guest
 

Re: P versus NP Problem: Is P = NP?

Postby Guest » Sun Feb 25, 2024 3:16 pm

Attachments
A1A10219-993B-4063-B3B7DBFEF8AC75B5_source.jpg
P versus NP Problem: Is P = NP? Yes!
A1A10219-993B-4063-B3B7DBFEF8AC75B5_source.jpg (269.79 KiB) Viewed 2434 times
Guest
 

Re: P versus NP Problem: Is P = NP?

Postby xwkons » Mon Jan 20, 2025 2:04 pm

Image

xwkons
 
Posts: 1
Joined: Mon Jan 20, 2025 2:02 pm
Reputation: 0

Previous

Return to Number Theory



Who is online

Users browsing this forum: No registered users and 1 guest

cron