NP-completeness

HOW IT IS BUILT The methods behind it Computational complex… Phylogenetic tree Multiple sequence ali… Contact map WHAT IT CAN DO Its core abilities WHERE IT IS USED — · — — · — NP-complete… learns · reasons · acts
How it's built
What it can do
Where it's used

NP-completeness is a classification in computer science that describes a special category of problems that are notoriously difficult to solve quickly. These are problems where checking whether a proposed solution is correct can be done relatively fast, but finding that solution in the first place seems to require an…