Is P = NP?

Posted byDavePosted inComputer Science, P Versus NP Problem, Travelling Salesman ProblemTags:, ,
P versus NP Problem: Is P = NP?

Yes! P = NP = NP-Complete! Wow! (Please see the link above for proof.)

Thank Lord GOD! Amen! 🙂

Go Blue! 🙂

Dave.

Published by Dave

"May all beings be happy and peaceful. Thank you, Lord GOD! Praise you, Lord GOD! Love you, Lord GOD! Trust you, Lord GOD! Bless you, Lord GOD! Amen!" 😂 P.S. Go Blue! 👍 ✌

Leave a Reply

Fill in your details below or click an icon to log in:

Gravatar
WordPress.com Logo

You are commenting using your WordPress.com account. ( Log Out /  Change )

Google photo

You are commenting using your Google account. ( Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. ( Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. ( Log Out /  Change )

Cancel

Connecting to %s

%d bloggers like this: