[[
wikihub
]]
Search
⌘K
Explore
People
For Agents
Sign in
Explore
People
For Agents
Sign in
@jemoka / Jemoka Knowledge Base / raw/concept/kbhprovability.md
Suggest edit
Cancel
Submit suggestion
Title
Name
Note
--- title: "Provability" source: https://www.jemoka.com/posts/kbhprovability/ --- Coping with NP Completeness It’s possible to solve NP complete problems! average case/worst case complexity: it’s possible to solve SAT for a lot of problems which solves the average case problems (“Heuristics vs. Algorithms”) special cases: 2SAT, subset sum, etc. can be solved in very special cases