Formal Definition For NP-completeness
There are many equivalent ways of describing NP-completeness.
Let be a language over a finite alphabet .
is NP-complete if, and only if, the following two conditions are satisfied:
- ; and
- any is polynomial-time-reducible to (written as ), where if, and only if, the following two conditions are satisfied:
- There exists such that
; and - there exists a polynomial-time Turing machine that halts with on its tape on any input .
- There exists such that
Read more about this topic: P Versus NP Problem
Famous quotes containing the words formal and/or definition:
“Good gentlemen, look fresh and merrily.
Let not our looks put on our purposes,
But bear it as our Roman actors do,
With untired spirits and formal constancy.”
—William Shakespeare (15641616)
“The very definition of the real becomes: that of which it is possible to give an equivalent reproduction.... The real is not only what can be reproduced, but that which is always already reproduced. The hyperreal.”
—Jean Baudrillard (b. 1929)
Related Phrases
Related Words