[[
wikihub
]]
Search
⌘K
Explore
People
For Agents
Sign in
Explore
People
For Agents
Sign in
@jemoka / Jemoka Knowledge Base / raw/concept/kbhp_vs_np.md
Suggest edit
Cancel
Submit suggestion
Title
Name
Note
--- title: "P vs. NP" source: https://www.jemoka.com/posts/kbhp_vs_np/ --- Polynomial Time \(P\) vs Non-Polynomial Time \(NP\) \(P\) are the problems that can be efficiently solved \(NP\) are the problems where proposed solutions can be efficiently verified so! is \(P=NP\)? If this is true, there are some consequences: proving can be automated cryptography would be able to be automated easily anywhere there is a problem can be globally optimized. This is too good to be true, so probably \(P \neq NP\).