Section 1 defines finite-alphabet languages, machine acceptance, worst-case running time, P and polynomially bounded verification for NP. The PDF upload path is not treated as its publication date.

Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3. Home

Incoming links (2)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version