# Definition:NP-Complete

Jump to navigation
Jump to search

## Definition

A problem $L$ is **NP-complete** if any problem in the complexity class NP can be reduced in polynomial time and space to $L$.