- My Forums
- Tiger Rant
- LSU Recruiting
- SEC Rant
- Saints Talk
- Pelicans Talk
- More Sports Board
- Fantasy Sports
- Golf Board
- Soccer Board
- O-T Lounge
- Tech Board
- Home/Garden Board
- Outdoor Board
- Health/Fitness Board
- Movie/TV Board
- Book Board
- Music Board
- Political Talk
- Money Talk
- Fark Board
- Gaming Board
- Travel Board
- Food/Drink Board
- Ticket Exchange
- TD Help Board
Customize My Forums- View All Forums
- Show Left Links
- Topic Sort Options
- Trending Topics
- Recent Topics
- Active Topics
Started By
Message
re: Thoughts on the P versus NP problem?
Posted on 3/21/22 at 11:04 pm to LordSaintly
Posted on 3/21/22 at 11:04 pm to LordSaintly
Not a mathematician or computer scientist
Would proving P=NP provide any information toward actually solving NP problems?
Is it possible to prove P=NP but still be practically unable to solve NP problems?
I guess I'm separating the academic potential that P could = NP and the practical real world potential of actually solving NP problems. So could we prove P=NP, but still have encryption safe?
Would proving P=NP provide any information toward actually solving NP problems?
Is it possible to prove P=NP but still be practically unable to solve NP problems?
I guess I'm separating the academic potential that P could = NP and the practical real world potential of actually solving NP problems. So could we prove P=NP, but still have encryption safe?
2
Page 1 of 1
Popular
Back to top
Follow TigerDroppings for LSU Football News