article · Figshare · 2018

The complexity of class TAUTOLOGY-NP

Vega, Frank

Cited by 0Open access

Abstract

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? This question was first mentioned in a letter written by John Nash to the National Security Agency in 1955. A precise statement of the P versus NP problem was introduced independently in 1971 by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. TAUTOLOGY-L is a problem of deciding given an instance x of a language L whether every possible appropriate answer for x is actually a solution in L. The class TAUTOLOGY-NP contains those languages TAUTOLOGY-L where L is in NP. Another major complexity class is NP-complete. To attack the P versus NP question the concept of NP-completeness has been very useful. We define the completeness of TAUTOLOGY-NP using the polynomial time reduction as well. We demonstrate there is a TAUTOLOGY-L language that is not only complete for TAUTOLOGY-NP, but it is also in P.

Cite this paper

APA 7

Vega, F. (2018). The complexity of class TAUTOLOGY-NP. Figshare. https://doi.org/10.6084/m9.figshare.6118844.v4

MLA 9

Vega, Frank. “The complexity of class TAUTOLOGY-NP.” Figshare, 2018, https://doi.org/10.6084/m9.figshare.6118844.v4.

Chicago

Vega, Frank. 2018. “The complexity of class TAUTOLOGY-NP.” Figshare. https://doi.org/10.6084/m9.figshare.6118844.v4.

Harvard

Vega, F. (2018) ‘The complexity of class TAUTOLOGY-NP’, Figshare. Available at: https://doi.org/10.6084/m9.figshare.6118844.v4.

BibTeX

@article{vega2018complexity,
  title = {{The complexity of class TAUTOLOGY-NP}},
  author = {Vega, Frank},
  journal = {Figshare},
  year = {2018},
  doi = {10.6084/m9.figshare.6118844.v4}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.