There is a newer version of this record available.

Preprint Open Access

Logarithmic Space Verifiers on NP-complete

Frank Vega


DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.3355777</identifier>
  <creators>
    <creator>
      <creatorName>Frank Vega</creatorName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0001-8210-4126</nameIdentifier>
      <affiliation>Joysonic</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Logarithmic Space Verifiers on NP-complete</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2019</publicationYear>
  <subjects>
    <subject>Complexity classes</subject>
    <subject>Completeness</subject>
    <subject>Verifier</subject>
    <subject>Reduction</subject>
    <subject>Polynomial time</subject>
    <subject>Logarithmic space</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2019-07-31</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Preprint</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/3355777</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.3355776</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;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? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. NP is the complexity class of languages defined by polynomial time verifiers M such that when the input is an element of the language with its certificate, then M outputs a string which belongs to a single language in P. Another major complexity classes are L and NL. The certificate-based definition of NL is based on logarithmic space Turing machine with an additional special read-once input tape: This is called a logarithmic space verifier. NL is the complexity class of languages defined by logarithmic space verifiers M such that when the input is an element of the language with its certificate, then M outputs 1. To attack the P versus NP problem, the NP-completeness is a useful concept. We demonstrate there is an NP-complete language defined by a logarithmic space verifier M such that when the input is an element of the language with its certificate, then M outputs a string which belongs to a single language in L.&lt;/p&gt;</description>
  </descriptions>
</resource>
1,375
651
views
downloads
All versions This version
Views 1,37548
Downloads 65125
Data volume 278.6 MB10.1 MB
Unique views 77445
Unique downloads 50222

Share

Cite as