P problems take polynomial amounts of time to solve(that's what stands for) Multiplication division etc.
Np problems take exponentially more time to solve as they get more complex(like sudoku) the problem is we don't know if they are fundamentally different types of problems. We don't know if NP type problems have fundamentally different ways of solving them then p problems. I and most of the community that knows about this think they are fundamentally different.
Your role as a moderator enables you immediately ban this user from messaging (bypassing the report queue) if you select a punishment.
7 Day Ban
7 Day Ban
30 Day Ban
Permanent Ban
This site uses cookies to provide you with the best possible user experience. By clicking 'Accept', you agree to the policies documented at Cookie Policy and Privacy Policy.
Accept
This site uses cookies to provide you with the best possible user experience. By continuing to use this site, you agree to the policies documented at Cookie Policy and Privacy Policy.
close
Our policies have recently changed. By clicking 'Accept', you agree to the updated policies documented at Cookie Policy and Privacy Policy.
Accept
Our policies have recently changed. By continuing to use this site, you agree to the updated policies documented at Cookie Policy and Privacy Policy.