Logarithmic Space Verifiers on NP-complete

Frank Vega

doi:10.20944/preprints201908.0037.v1

Submit preprint
How it Works
Instructions for Authors
Subject Areas
Advisory Board
screening preprints
About
Awards
Log in/Register

Instructions for Authors
Awards
About
FAQ
Submit Log in/Register

Share this article with

Create alert

Email:

Load new image

preprints.org > computer science and mathematics > computer science > doi: 10.20944/preprints201908.0037.v1

Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Logarithmic Space Verifiers on NP-complete

Frank Vega

Version 1 : Received: 1 August 2019 / Approved: 5 August 2019 / Online: 5 August 2019 (03:31:23 CEST)
Version 2 : Received: 26 November 2019 / Approved: 29 November 2019 / Online: 29 November 2019 (07:28:14 CET)
Version 3 : Received: 4 April 2020 / Approved: 6 April 2020 / Online: 6 April 2020 (12:57:55 CEST)
Version 4 : Received: 15 April 2020 / Approved: 16 April 2020 / Online: 16 April 2020 (10:17:03 CEST)
Version 5 : Received: 18 September 2020 / Approved: 19 September 2020 / Online: 19 September 2020 (09:51:02 CEST)
Version 6 : Received: 10 February 2021 / Approved: 11 February 2021 / Online: 11 February 2021 (11:56:37 CET)
Version 7 : Received: 19 August 2021 / Approved: 27 August 2021 / Online: 27 August 2021 (14:09:47 CEST)
Version 8 : Received: 20 October 2021 / Approved: 26 October 2021 / Online: 26 October 2021 (11:07:59 CEST)
Version 9 : Received: 7 March 2024 / Approved: 8 March 2024 / Online: 8 March 2024 (11:06:11 CET)
Version 10 : Received: 14 March 2024 / Approved: 14 March 2024 / Online: 14 March 2024 (10:11:13 CET)
Version 11 : Received: 14 March 2024 / Approved: 15 March 2024 / Online: 18 March 2024 (08:29:48 CET)
Version 12 : Received: 29 March 2024 / Approved: 1 April 2024 / Online: 1 April 2024 (17:14:22 CEST)
Version 13 : Received: 6 April 2024 / Approved: 6 April 2024 / Online: 8 April 2024 (06:04:04 CEST)
Version 14 : Received: 11 April 2024 / Approved: 11 April 2024 / Online: 12 April 2024 (04:51:11 CEST)

How to cite: Vega, F. Logarithmic Space Verifiers on NP-complete. Preprints 2019, 2019080037. https://doi.org/10.20944/preprints201908.0037.v1 Vega, F. Logarithmic Space Verifiers on NP-complete. Preprints 2019, 2019080037. https://doi.org/10.20944/preprints201908.0037.v1

Cite

Export citation file: Bib TeX | RIS

MDPI and ACS Style

Vega, F. Logarithmic Space Verifiers on NP-complete. Preprints 2019, 2019080037. https://doi.org/10.20944/preprints201908.0037.v1

APA Style

Vega, F. (2019). Logarithmic Space Verifiers on NP-complete. Preprints. https://doi.org/10.20944/preprints201908.0037.v1

Chicago/Turabian Style

Vega, F. 2019 "Logarithmic Space Verifiers on NP-complete" Preprints. https://doi.org/10.20944/preprints201908.0037.v1

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? 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 f ailed. NP is the complexity class of languages defined b y p olynomial t ime v erifiers M su ch th at wh en th e in put is an el ement 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 s uch t hat when t he i nput i s a n e lement o f t he l anguage with i ts c ertificate, th en 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 s tring which belongs to a single language in L. In this way, we obtain if L is not equal to NL, then P = NP. In addition, we show that L is not equal to NL. Hence, we prove the complexity class P is equal to NP.

Supplementary and Associated Material

https://github.com/frankvegadelgado/VerifyReduction: GitHub repository

https://hal.archives-ouvertes.fr/hal-02199310: HAL Preprint

https://www.academia.edu/39973754/Logarithmic_Space_Verifiers_on_NP-complete: Academia Preprint

Keywords

complexity classes; completeness; verifier; reduction; polynomial time; logar-ithmic space

Subject

Computer Science and Mathematics, Computer Science

Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Download PDF

Comments (0)

Not displayed online.

Importance: How significant is the paper to the field?

Outstanding/highlight paper

Significant contribution

Incremental contribution

No contribution

I am not qualified to judge

Soundness of evidence/arguments presented:

Conclusions well supported

Most conclusions supported (minor revision needed)

Incomplete evidence (major revision needed)

Hypothesis, unsupported conclusions, or proof-of-principle

I am not qualified to judge

Please leave your comment to this article below.

Mathematical equations can be typed in either LaTeX formats \\[ ... \\] or $$ ... $$, or MathML format <math> ... </math>. Try the LaTeX or MathML example.

Type equation:

Preview:

Copy equation into message below

Close menu

Please click a symbol to insert it into the message box below:

Please enter the link here:

Please enter a valid URL

Optionally, you can enter text that should appear as linked text:

Copy link into message below

Close menu

Please enter or paste the URL to the image here (please only use links to jpg/jpeg, png and gif images):

Please enter a valid URL

Copy image into message below

Close menu

Type author name or keywords to filter the list of references in this group (you can add a new citation under Bibliography):

No existing citations in Discussion Group

Wikify editor is a simple editor for wiki-style mark-up. It was written by MDPI for Sciforum in 2014. The rendering of the mark-up is based on Wiky.php with some tweaks. Rendering of mathematical equations is done with MathJax. Please send us a message for support or for reporting bugs.

Close menu

Please declare any conflicts of interest you may have with this paper, financial or otherwise.

I do not have a conflict of interest

I would like to declare a conflict of interest

Display my name on the website Send my name and email address to the authors

Captcha

Renew

I accept the following conditions:

Comments must follow the standards of professional discourse and should focus on the scientific content of the article. Insulting or offensive language, personal attacks and off-topic remarks will not be permitted. Comments must be written in English. Preprints reserves the right to remove comments without notice. Readers who post comments are obliged to declare any competing interests, financial or otherwise.

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)

* All users must log in before leaving a comment

what’s this?

Add a record of this review to Publons to track and showcase your reviewing expertise across the world’s journals.

Downloads 0

Comments 0

Metrics 0

Get PDF Cite Share 0

Bookmark BibSonomy Mendeley Reddit Delicious

Alerts

Notify me about updates to this article or when a peer-reviewed version is published.

Preprints.org is a free preprint server subsidized by MDPI in Basel, Switzerland.

MDPI Initiatives

SciProfiles
Sciforum
Encyclopedia
MDPI Books
Scilit
Proceedings
JAMS

Important links

How it Works
Advisory Board
FAQ
Friendly Journals
Instructions for Authors
About
Statistics

Choose the area that interest you and we will send you notifications of new preprints at your preferred frequency.

Disclaimer

We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.

RSS feed for

Preprints: The Multidisciplinary Preprint Platform

Paste the URL in your RSS reader:

https://www.preprints.org/rss

If you want to subscribe our website in subject-wide, you could find the URL by choosing in the following:

https://www.preprints.org/rss

Please note that by using ScienceDirect RSS feeds, you agree to our Terms of Use and Privacy Policy.