Np Completeness Glossary
Browse 2 np completeness terms defined in plain English, from the cultural dictionary of computing.
2 Np Completeness Terms
- Reduction
- A transformation of one problem into another that preserves the difficulty relationship. If problem A reduces to problem B, then B is at least as hard as A....
- SAT Problem
- The Boolean satisfiability problem: given a logical formula, determine whether there exists an assignment of true/false values to its variables that makes the...
Related Topics
- Complexity Theory (2 terms in common)
- Boolean Logic (1 terms in common)
- Proofs (1 terms in common)