P Versus NP Problem - Formal Definition For NP-completeness

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:

  1. ; and
  2. any is polynomial-time-reducible to (written as ), where if, and only if, the following two conditions are satisfied:
    1. There exists such that \forall w\in\Sigma^{*}(w\in L^{'}\Leftrightarrow f(w)\in L); and
    2. there exists a polynomial-time Turing machine that halts with on its tape on any input .

Read more about this topic:  P Versus NP Problem

Famous quotes containing the words formal and/or definition:

    “I will not let him stir
    Till I have used the approvèd means I have,
    With wholesome syrups, drugs, and holy prayers,
    To make of him a formal man again.”
    —William Shakespeare (1564–1616)

    “Perhaps the best definition of progress would be the continuing efforts of men and women to narrow the gap between the convenience of the powers that be and the unwritten charter.”
    —Nadine Gordimer (b. 1923)