Computer Science – Computational Complexity
Scientific paper
2004-06-28
Computer Science
Computational Complexity
Scientific paper
We claim to resolve the P=?NP problem via a formal argument for P=NP.
Bringsjord Selmer
Taylor Joshua
No associations
LandOfFree
P=NP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with P=NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and P=NP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-385524