## Economics Dictionary of ArgumentsHome | |||

| |||

NP-Completeness - Economics Dictionary of Arguments | |||

NP-completeness: NP-completeness is a concept in computational complexity theory. A problem is NP-complete if it is both in NP (meaning that it can be solved in polynomial time by a non-deterministic Turing machine) and NP-hard (meaning that every other problem in NP can be reduced to it in polynomial time). See also Calculability, Complexity, Reducibility, Turing-Machine._____________ Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments. | |||

Author | Item | More concepts for author | |
---|---|---|---|

Norvig, Peter | NP-Completeness | Norvig, Peter | |

Russell, Stuart J. | NP-Completeness | Russell, Stuart J. | |

Ed. Martin Schulz, access date 2024-11-02 |