There is a newer version of this record available.

Preprint Open Access

# Logarithmic Space Verifiers on NP-complete

Frank Vega

### JSON Export

{
"files": [
{
},
"checksum": "md5:9246f05d509546d9ab0ceba55c745de2",
"key": "manuscript.pdf",
"type": "pdf",
"size": 405437
}
],
"owners": [
45971
],
"doi": "10.5281/zenodo.3355777",
"stats": {
"unique_views": 43.0,
"views": 46.0,
"version_views": 589.0,
"version_unique_views": 411.0,
"volume": 7703303.0,
"version_volume": 160721299.0
},
"doi": "https://doi.org/10.5281/zenodo.3355777",
"conceptdoi": "https://doi.org/10.5281/zenodo.3355776",
"html": "https://zenodo.org/record/3355777",
"latest_html": "https://zenodo.org/record/3687348",
"latest": "https://zenodo.org/api/records/3687348"
},
"conceptdoi": "10.5281/zenodo.3355776",
"created": "2019-07-31T01:05:57.298259+00:00",
"updated": "2020-02-26T02:07:48.431864+00:00",
"conceptrecid": "3355776",
"revision": 78,
"id": 3355777,
"access_right_category": "success",
"doi": "10.5281/zenodo.3355777",
"description": "<p>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.</p>",
"id": "CC-BY-4.0"
},
"title": "Logarithmic Space Verifiers on NP-complete",
"relations": {
"version": [
{
"count": 43,
"index": 0,
"parent": {
"pid_type": "recid",
"pid_value": "3355776"
},
"is_last": false,
"last_child": {
"pid_type": "recid",
"pid_value": "3687348"
}
}
]
},
"keywords": [
"Complexity classes",
"Completeness",
"Verifier",
"Reduction",
"Polynomial time",
"Logarithmic space"
],
"publication_date": "2019-07-31",
"creators": [
{
"orcid": "0000-0001-8210-4126",
"affiliation": "Joysonic",
"name": "Frank Vega"
}
],
"access_right": "open",
"resource_type": {
"subtype": "preprint",
"type": "publication",
"title": "Preprint"
},
"related_identifiers": [
{
"scheme": "doi",
"identifier": "10.5281/zenodo.3355776",
"relation": "isVersionOf"
}
]
}
}
589
371
views